Menu

Question Discussion & Solution

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

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Shift reduce parsers are __________
forum Discussion
MCQ
2.
Which of these is true about LR parsing?
forum Discussion
MCQ
3.
( Z,* ) be a structure, and * is defined by n * m =maximum (n, m) Which of the following statements is true for ( Z, * )?
forum Discussion
MCQ
4.
Which of the following derivations does a top-down parser use while parsing an input string?
forum Discussion
MCQ
5.
A grammar that produces more than one parse tree for some sentence is called __________
forum Discussion

category More Compiler Design Topics

article

Compiler Design Basics

format_list_bulleted 61 MCQs
article

Non Deterministic Finite Automata

format_list_bulleted 26 MCQs
article

Lexical Analysis

format_list_bulleted 64 MCQs
article

Regular Expressions

format_list_bulleted 64 MCQs
article

Finite Automata

format_list_bulleted 48 MCQs
article

Syntax Analyser

format_list_bulleted 29 MCQs
article

Semantic Analyser

format_list_bulleted 11 MCQs
article

Run Time Environment

format_list_bulleted 10 MCQs
article

Code Generation

format_list_bulleted 12 MCQs
article

Code Optimization

format_list_bulleted 22 MCQs
article

Parsing

format_list_bulleted 110 MCQs
article

Transformation from NFA to DFA

format_list_bulleted 15 MCQs
article

Cross Compiler

format_list_bulleted 15 MCQs
article

Epsilon Moves

format_list_bulleted 15 MCQs