Consider the grammar defined by the following production rul...

MCQ

Consider the grammar defined by the following production rules:

  S --> T * P 
    T --> U | T * U
    P --> Q + P | Q
    Q --> Id
    U --> Id

Which one of the following is TRUE?

+ is left associative, while ? is right associative

+ is right associative, while ? is left associative

Both + and ? are right associative

Both + and ? are left associative

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following describes a handle (as applicable to LR-parsing) appropriately?

Position where next reduce or shift operation will occur

The next step has use of Non-terminal for reduction

Used for reduction in a coming-up step along with a position in the sentential form where the next shift or reduce operation will occur

Used in the next step for reduction along with a position in the sentential form where the right hand side of the production may be found

Discussion

MCQ

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion only

Factoring the grammar alone

Factoring & left recursion removal

None of the above

Discussion

MCQ

Consider the following grammar G.

 S ? F ? H
  F ? p ? c
  H ? d ? c

Which one is true?S1: All strings generated by G can be parsed with help of LL (1).
S2: All strings generated by G can be parsed with help of LR (1).

Only S1

Only S2

Both S1 & S2

None of the mentioned

Discussion

MCQ

Which is the most powerful parser?

SLR

LALR

Canonical LR

Operator PrecedenceThe most powerful parser is Canonical LR

Discussion

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

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