The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
50 views
Let G be any grammar with the following productions:

X → X + Y | Y

Y → Y * Z | Z

Z → (X)

Z → id

If LR(!) parser is used to parse the above grammar, then total how many look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________.

Please explain your answer.
closed with the note: duplicate
asked in Compiler Design by Active (3.3k points)
closed by | 50 views
0

https://gateoverflow.in/283612/lr-1

 

 

closed the question after watching this

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,541 questions
54,083 answers
187,206 comments
70,992 users