Redirected
retagged by
2,043 views
0 votes
0 votes
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.
retagged by

1 Answer

Related questions

0 votes
0 votes
1 answer
4
Na462 asked Jan 16, 2019
763 views
Which of the Statements are True :S1: LR(1) grammar can be LR(0) but not LL(1).S2 : Every regular language is LL(1)S3 : Three address code is linear representation of Syn...