Test: LR Parser - Computer Science Engineering (CSE) MCQ

SLR

LR

LLR

None of the mentioned

Use same algorithm, but different parsing table.

Same parsing table, but different algorithm.

Their Parsing tables and algorithm are similar but uses top down approach.

Both Parsing tables and algorithm are different.

The parsing starts

It is possible to do so a left-to-right scan of the input.

It is possible to do so a right-to-left scan of the input.

Parsing ends

Only I)

I) and ii)

I), ii) and iii)

I), ii) , iii) and iv)

Shift/reduce conflict

Reduce /shift conflict

Shift conflict

Reduce conflict

If a state does not know whether it will make a shift operation using the production rule i or j for a terminal.

If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal.

If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal.

None of the mentioned

Will be affecting.

Does not have any affect.

Shift will take place.

Reduction will take place.

If next symbol is a terminal

Only If the next input symbol is a

Only If the next input symbol is A

none of these

Closure and goto operations work a little bit different

Closure and goto operations work similarly

Closure and additive operations work a little bit different

Closure and associatively operations work a little bit different

Contains all constants in the program

Is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure?

Consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation

Is a permanent table which lists all keywords and special symbols of the language in symbolic form?