TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The following grammar:S
|
|
first (S)={a, d}
|
|
|
follow(S)={
|
|
|
This is not LL(1) grammar
|
|
|
This is LL(1) Grammar
|
Explanation:
Detailed explanation-1: -A grammar whose parsing table has no multiply-defined en-tries is said to be LL(1) which stands for: scanning the input from Left to right producing a Leftmost derivation and using 1 input symbol of lookahead at each step to make parsing action decisions.
There is 1 question to complete.