Question Discussion & Solution

MCQ

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion only

Factoring the grammar alone

Factoring & left recursion removal

None of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following pairs is the most powerful?

SLR, LALR

Canonical LR ,LALR

SLR canonical LR

LALR canonical LR

Discussion

MCQ

Inherited attribute is a natural choice in ___________

Variable declarations record is maintained

L values and R values

All of the mentioned

None of the mentioned

Discussion

MCQ

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion only

Factoring the grammar alone

Factoring & left recursion removal

None of the mentioned

Discussion

MCQ

Consider the following grammar G.

 S ? F ? H
  F ? p ? c
  H ? d ? c

Which one is true?S1: All strings generated by G can be parsed with help of LL (1).
S2: All strings generated by G can be parsed with help of LR (1).

Only S1

Only S2

Both S1 & S2

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

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