img
All Q&A
1

Explain different stages of compiler with a suitable example. What is token, Patterns and Lexeme?

12 October, 2024
Compiler operates in phases. • Each phase transforms the source program from one representation to another.
3

What do you mean by a Handle? Give example. When a grammar is called ambiguous? Is there any technique to remove ambiguity? Explain with an example. What is the reduce-reduce conflict in LR parser? What are various data structures used for symbol table construction?

12 October, 2024
A handle of a string is a substring that matches the right side of a production, and whose reduction to the non-terminal on the left side of the production represents one step along the reverse of a rightmost derivation.
4

Describe various actions of a shift reduce parsers.

12 October, 2024
Actions of shift-reduce parsers: A shift-reduce parser works by doing some combination of Shift steps and Reduce steps, hence the name.