What is the maximum number of reduce moves that can be taken...

MCQ

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?

n/2

n-1

2n-1

2^n

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In which way a macro processor for assembly language can be implemented?

Independent one-pass processor

Processor put into pass 1 of a standard two pass assembler

All of the mentioned

Discussion

MCQ

Running time of a program depends on __________

Addressing mode

Order of computations

The usage of machine idioms

All of the mentioned

Discussion

MCQ

Relocating bits used by relocating loader are specified by __________

Relocating loader itself

Linker

Assembler

Macro Processor

Discussion

MCQ

Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->

Only I)

I) and ii)

I), ii) and iii)

I), ii) , iii) and iv)

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

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