Question Discussion & Solution

MCQ

YACC builds up __________

SLR parsing table

Canonical LR parsing table

LALR parsing table

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

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

Discussion

MCQ

Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

120

160

Discussion

MCQ

Given the following expression grammar:

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

* has higher precedence than +

+ and

+ has higher precedence than *

Discussion

MCQ

When the parser starts constructing the parse tree from the start symbol and then tries to transform the start symbol to the input, it is called?

bottom-up parsing

top-down parsing

Both A and B

None of the above

Discussion

MCQ

Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

200

180

160

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