An LR-parser can detect a syntactic error as soon as _______...

MCQ

An LR-parser can detect a syntactic error as soon as __________

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

What is terminal table?

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

Discussion

MCQ

LR parsers are attractive because _________

It can be constructed to recognize CFG corresponding to almost all programming constructs

It does not backtrack

It can be constructed to recognize CFG corresponding to almost all programming constructs & It does not backtrack

None of the mentioned

Discussion

MCQ

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

Leftmost derivation

Leftmost derivation in reverse

Rightmost derivation

Rightmost derivation in reverse

Discussion

MCQ

The bottom-up parsing method is also called

Shift reduce parsing

Predictive parsing

Recursive descent parsing

None of these

Discussion

MCQ

Which one of the following is true at any valid state in shift-reduce parsing?

At the bottom we find the prefixes

None of the mentioned

Stack contains only viable prefixes

Stack consists of viable prefixes

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics