GATE CSE: Compiler design

Question 1 of 10

Which phase checks that the token stream follows the grammar and builds a parse tree?

Question 2 of 10

The output of lexical analysis is:

Question 3 of 10

Left recursion has to be removed from a grammar before using:

Question 4 of 10

Which of these parsers is the most powerful (accepts the largest class of grammars)?

Question 5 of 10

For the same grammar, an LALR(1) parser has how many states compared to SLR(1)?

Question 6 of 10

Three-address code is:

Question 7 of 10

Constant folding means:

Question 8 of 10

An S-attributed definition uses only:

Question 9 of 10

The symbol table stores:

Question 10 of 10

Peephole optimisation works on: