Theory of Computation and Compilers - Syntax Analysis
| a | b | d | $ |
| 3 | 2 | 1 | 0 |
- Option : A
- Explanation : S → Aa A → BD B → b|ε D → d|ε Follow (B) = {d, a} Hence index value in descending order is 31.
22. Which of the following statements is true?
- Option : B
- Explanation : Number of st at e in SLR is always same as number of st ate in LALR parser.
- Option : A
- Explanation : S → iE tSS1\a S' ⇒ eS|a E → b This is left factor grammar Thus we may expand S to ibtSS' on input i and wait untill ibtS has been seen to decide whether to expand S' → eS|∈
*/?>
*/?>
*/?>
*/?>