Compiler Design Quiz

1. The language defined by regular grammar is known as?

regular language
regular grammar
regular notations
regular operation

2. A form of recursive-descent parsing that does not require any back-tracking is known as?

predictive parsing
non-predictive parsing
recursive parsing
non-recursive parsing

3. Which of the following are Limitations of Syntax Analyzers?

it cannot determine if a token is valid,
it cannot determine if a token is declared before it is being used,
it cannot determine if an operation performed on a token type is valid or not.
All of the above

4. lexical analyzer is used to ?

remove whitespace
removing comments
breaks these syntaxes into a series of tokens
All of the above

5. The output of an assembler is called?

data file
task file
object file
program file

6. Which of the following is true?

In Short Syntax Analysis Generates Parse Tree.
Syntax analyser does not check the type of the operand.
Symbol table is created by the compiler which contains the list of lexemes or tokens.
All of the above

7. In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?

TRUE
FALSE
Can be true or false
Can not say

8. Languages of a automata is

If it halts
If it is accepted by automata
If automata touch final state in its life time
All language are language of automata

9. Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.

n1 is necessarily less than n2
n1 is necessarily equal to n2
n1 is necessarily greater than n2
None of the above

10. Which of them are not left associative?

*
|
plus(+)
.