Given the following expression grammar:E -> E * F | F + E | ...

MCQ

Given the following expression grammar:

E -> E * F | F + E | F
F -> F - F | id

* has higher precedence than +

+ and

+ has higher precedence than *

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Compiler can diagnose __________

Grammatical errors only

Logical errors only

Grammatical and logical errors

None of the mentioned

Discussion

MCQ

The linker __________

Is similar to interpreter

Uses source code as its input

Is required to create a load module

None of the mentioned

Discussion

MCQ

Which of the following system program forgoes the production of object code to generate absolute machine code and load it into the physical main storage location from which it will be executed immediately upon completion of the assembly?

Two pass assembler

Load and go assembler

Macro processor

Linker

Discussion

MCQ

In operator precedence parsing whose precedence relations are defined _________

For all pair of non-terminals

For all pair of terminals

To delimit the handle

None of the mentioned

Discussion

MCQ

When there is a reduce/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

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