Menu

Question Discussion & Solution

MCQ
Q.
Consider the following two sets of LR (1) items of an LR (1) grammar.

X -> c.X, c/d
   X -> .cX, c/d
   X -> .d, c/d
   X -> c.X, $
   X -> .cX, $
   X -> .d, $
Which one is false?

1. Cannot be merged since look ahead

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.
A bottom up parser generates __________
forum Discussion
MCQ
2.
A programmer by mistake writes multiplication instead of division, such error can be detected by?
forum Discussion
MCQ
3.
Consider the grammar defined by the following production rules:
  S --> T * P 
    T --> U | T * U
    P --> Q + P | Q
    Q --> Id
    U --> Id
Which one of the following is TRUE?
forum Discussion
MCQ
4.
Pee Hole optimization __________
forum Discussion
MCQ
5.
A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar S
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