The grammar A ? AA | (A) | e is not suitable for predictive-...

MCQ

The grammar A ? AA | (A) | e is not suitable for predictive-parsing because the grammar is?

Ambiguous

Left recursive

Right recursive

An operator grammar

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?

Closure and goto operations work a little bit different

Closure and goto operations work similarly

Closure and additive operations work a little bit different

Closure and associatively operations work a little bit different

Discussion

MCQ

LR parsers are attractive because _________

It can be constructed to recognize CFG corresponding to almost all programming constructs

It does not backtrack

It can be constructed to recognize CFG corresponding to almost all programming constructs & It does not backtrack

None of the mentioned

Discussion

MCQ

The bottom-up parsing method is also called

Shift reduce parsing

Predictive parsing

Recursive descent parsing

None of these

Discussion

MCQ

Running time of a program depends on __________

Addressing mode

Order of computations

The usage of machine idioms

All of the mentioned

Discussion

MCQ

In operator precedence parsing whose precedence relations are defined _________

For all pair of non-terminals

For all pair of terminals

To delimit the handle

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