Which of the following suffices to convert an arbitrary CFG ...

MCQ

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

Removing left Recursive alone

Factoring the grammar alone

Along with removing left recursion we also perform the factoring of the grammar

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

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

Match the following.

   List-I                  List-II
A. Lexical analysis       1. Graph coloring
B. Parsing                2. DFA minimization
C. Register allocation    3. Post-order traversal
D. Expression evaluation  4. Production tree

Discussion

MCQ

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.n1 is necessarily less than n2

n1 is necessarily less than n2

n1 is necessarily equal to n2

n1 is necessarily greater than n2

None of the above

Discussion

MCQ

A programmer by mistake writes multiplication instead of division, such error can be detected by?

Compiler

Interpreter

Compiler or interpreter test

None of the mentioned

Discussion

MCQ

An intermediate code form is ___________

Postfix Notation

Syntax Trees

Three address code

All 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