Consider the following grammar: E \rightarrow E+T/T T \rightarrow T*F/

Back to the 2023 paper

Module 2 : Syntax Analysis (Parser)

20236m

Consider the following grammar:
$E \rightarrow E+T/T$
$T \rightarrow T*F/F$
$F \rightarrow (E)/id$

Obtain FIRST and FOLLOW sets of the above grammar.

Similar questions

Compiler DesignConsider the following grammar: E \rightarrow E+T/T T \rightarrow T*F/F F \rightarrow (E)/id Construct Predictive Parsing Table of the above grammar.20238m Compiler DesignCompute FIRST and FOLLOW for the given grammar. Also derive the LL(1) parsing table. E \rightarrow TE' E' \rightarrow + TE' / \epsilon T \rightarrow FT' T' \rightarrow * FT' / \epsilon F \rightarrow (E) / id20227m Compiler DesignConsider the following grammar: E \rightarrow E + T | T T \rightarrow T * F | F F \rightarrow (E) | id Construct the canonical collection of LR(0) items.20244m Compiler DesignConsider the following grammar: E \rightarrow E + T | T T \rightarrow T * F | F F \rightarrow (E) | id Build the SLR(1) parsing table using the above items.20244m

PreviousWhen a grammar is called ambiguous? Is there any technique to remove ambiguity? Justify whether the following grammar is ambiguous or not? S \rightarrow aS/Sa/a NextConsider the following grammar: E \rightarrow E+T/T T \rightarrow T*F/F F \rightarrow (E)/id Construct Predictive Parsing Table of the above grammar.

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play