In the context of abstract-syntax-tree and control-flow-grap...

MCQ

In the context of abstract-syntax-tree and control-flow-graph. Which one of the following is true?

In both AST and CFG if node N2 be the successor of node N1

For any input program, neither AST nor CFG will contain a cycle

The max number of successors of a node in an AST and a CFG depends on the input program

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Pee Hole optimization __________

Loop Optimization

Local Optimization

Constant folding

Data Flow analysis

Discussion

MCQ

The action of parsing the source program into proper syntactic classes is called __________

Syntax Analysis

Lexical Analysis

Interpretation analysis

General Syntax Analysis

Discussion

MCQ

A system program that combines separately compiled modules of a program into a form suitable for execution is?

Assembler

Linking Loader

Cross Compiler

None of the mentioned

Discussion

MCQ

Given the following expression grammar:

E -> E * F | F+E | F
F -> F-F | id

which of the following is true?

* has higher precedence than +

+ and

+ has higher precedence than *

Discussion

MCQ

Which of these is true about LR parsing?

Is most general non-backtracking shift-reduce parsing

It is still efficient

Is most general non-backtracking shift-reduce parsing & It is still efficient

None of the mentioned

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics