
Compiler Parsing Techniques
Authored by Gowtham Sethupathi
Computers
University
Used 2+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The parsing technique that starts from the root of the parse tree and recursively expands non-terminals to derive the input string is called:
LR Parsing
SLR Parsing
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The parsing technique that starts from the input terminal of the parse tree and reduces to start symbol is called:
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which parsing technique uses a predictive parsing table to decide which production to apply for a given input symbol and stack top?
LL
LR
SLR
LALR
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The parsing technique that builds a shift-reduce parser and uses lookahead to handle conflicts is known as:
LALR Parsing
LR(0)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The parsing technique that uses a parsing table containing both shift and reduce actions to process the input is called:
LR Parsing
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which parsing technique can handle a larger class of grammars due to its powerful handling of lookaheads?
LALR parsing
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which parser construction method is used in CLR parsing?
Operator precedence Parsing
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?