Given a context-free grammar (CFG), compute FIRST and FOLLOW sets for

Back to the 2024 paper

Module 2 : Syntax Analysis (Parser)

20247m

Given a context-free grammar (CFG), compute FIRST and FOLLOW sets for all non-terminals, and construct the LL(1) parsing table. Also, determine whether the grammar is LL(1) or not.
Grammar:
$S \rightarrow A B$
$A \rightarrow a A | \epsilon$
$B \rightarrow b B | \epsilon$

Search Google Ask AI

Similar questions

Compiler DesignDescribe the working of LL(1) parser. Draw the LL(1) parsing table for the given grammar: S \rightarrow aA \mid bB A \rightarrow a B \rightarrow b20257m 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 DesignCheck whether the following grammar is LL(1) grammar or not : S \rightarrow iEtSA | a A \rightarrow eS | \epsilon E \rightarrow b20197m Compiler DesignChoose the correct answer of the following: To convert an arbitrary CFG to an LL(1) grammar (i) factor the grammar alone (ii) remove left recursion alone (iii) remove left recursion and factor the grammar (iv) None of the above20192m

PreviousDesign a finite automaton that accepts all binary strings that do not contain the substring "101".NextConsider 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.