Parsing

Which of the following lexical entries can be derived from <word>

I. pick

II picks

III c44

• I, II AND III

• I and II only

• I and III only

• II and III only

A bottom up parser generates __________.

• Right most derivation

• Rightmost derivation in reverse

• Leftmost derivation

• Leftmost derivation in reverse

Shift reduce parsers are __________.

• Top down Parser

• Bottom Up parser

• May be top down or bottom up

• None of the mentioned

Which of the following describes a handle (as applicable to LR-parsing) appropriately?

• Position where next reduce or shift operation will occur

• The next step has use of Non-terminal for reduction

• Used for reduction in a coming-up step along with a position in the sentential form where the next shift or reduce operation will occur

• Used in the next step for reduction along with a position in the sentential form where the right hand side of the production may be found

Consider the grammar defined by the following production rules:

S --> T * P

T --> U | T * U

P --> Q + P | Q

Q --> Id

U --> Id

Which one of the following is TRUE?

• + is left associative, while ∗ is right associative

• + is right associative, while ∗ is left associative

• Both + and ∗ are right associative

• Both + and ∗ are left associative

Which of the following grammar rules violate the requirements of an operator grammar?

(i) P -> QR

(ii) P -> QsR

(iii) P -> ε

(iv) P -> QtRr

• (i) only

• (i) and (iii) only

• (ii) and (iii) only

• (iii) and (iv) only

Which of the following actions an operator precedence parser may take to recover from an error?

• Delete symbols from the stack

• Insert symbols onto the stack

• Inserting or deleting symbols from the input

• Stop the parsing

In ___________________ , if one derivation of a production fails, the syntax analyser restarts the process using different rules of same production.

• Bottom-up Parsing

• Recursive descent parsing

• Predictive Parsing

• operator precedence parsing

The predictive parser puts some constraints on the grammar and accepts only a class of grammar known as LL(k) grammar.

• True

• False

• Can be true or false

• Can't say

Which of the following is sufficient to convert an arbitrary CFG to an LL(1) grammar?

• Removing left recursion alone

• Factoring the grammar alone

• Removing left recursion and factoring the grammar

• None of the above