Compiler Design Quiz I June 18

What is the use of a symbol table in compiler design?

• Finding name’s scope

• Type checking

• Keeping all of the names of all entities

• All of the mentioned

A compiler is preferable to an interpreter because

• Debugging can be faster and easier

• If one changes a statement, only that statement needs re-compilation

• It is much helpful in the initial stages of program development

• It can generate stand alone programs that often take less time for execution

A top-down parser generates

• Left-most derivation in reverse

• Right-most derivation in reverse

• Left-most derivation

• Right –most derivation

Which of the following parsers is the most powerful?

• SLR

• LALR

• Canonical LR

• Operator-precedence

Synthesized attribute can be easily simulated by a

• LR grammar

• LL grammar

• Ambiguous grammar

• Left recursive grammar

The lexical analyzer takes ____ as input and produces a list of ___ of output.

• Source code, tokens

• Machine code, Source code

• Tokens, source code

• Token, Target code

__________ reads a program, analyze it, and attempts to discover potential bugs without running the program.

• Structure editor

• Interpreters

• Pretty printers

• Static checker

____________ is regular expression for generating an integer numbers where digit->0|1|2|…|9

• (digit)+

• (digit|letter)+  

• (letter|digit)+ 

• (digit)*

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?

• n/2

• 2n-1

• n-1

• 2^n

The parsing technique that avoids backtracking is

• Recursive-descent parsing

• Top down parsing

• CLR(1)

• LALR(1)