Parser - unit 2 and 3

A grammar that produces more than one parse tree for some sentence is called __________

• Ambiguous

• UnAmbiguous

• Regular

• None of the mentioned

Which of the following derivations does a top-down parser use while parsing an input ?

• Which of the following derivations does a top-down parser use while parsing an input ?

• Which of the following derivations does a top-down parser use while parsing an input ?

• Rightmost derivation

•  Rightmost derivation traced out in reverse

Which of the following error can a compiler check?

• Syntax Error

• Logical Error

• Both Logical and Syntax Error

• Compiler cannot check errors

which ine of the following is a top-down parser

• LR(k) parser

• Operator precedence parser

• Recursive Descent parser

• LALR(k) parser

Which of the following statements is false?

• An LL(1) parser is a top-down parser

• An unambiguous grammar has the same leftmost and rightmost derivation

• LALR is more powerful than SLR

• An ambiguous grammar can never be LR(k) for any k

YACC is a: 

• Lexical analyzer generator Parser generator 

• Parser generator 

• Semantic analyzer 

• None of the above

Given grammar 

S –> (L) | a 

L –> L, S | S 

Which of the input recognized by the grammar: 

•  ((a, a), a) 

•  (a,a) 

• ((a, a,a),a) 

•  All of the above

The bottom-up parsing method is also called

• Recursive descent parsing

• Predictive parsing

• Shift reduce parsing

• None of these

The action of parsing the source program into proper syntactic classes is called __________

• Syntax Analysis

• Lexical Analysis

• Interpretation analysis

• General Syntax Analysis

Given the following expression grammar:

(1) E -> E * F | F+E | F

(2) F -> F-F | id LEAD (E) is

• * +

• * + -

• * + - id

• * + id