Menu

Question Discussion & Solution

MCQ
Q.
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).

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.
Consider the grammar.

E ? E + n | E 
forum Discussion
MCQ
2.
YACC builds up __________
forum Discussion
MCQ
3.
LR parsers are attractive because _________
forum Discussion
MCQ
4.
Match the following.

P. Regular expression        1. Syntax analysis
Q. Pushdown automata         2. Code generation
R. Dataflow analysis         3. Lexical analysis
S. Register allocation       4. Code optimization
forum Discussion
MCQ
5.
Which of the following is a phase of a compilation process?
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