Consider a grammar A \to a S_1 | a S_2. The left factored grammar prod

Back to the 2023 paper

Module 2: Syntax Analysis (Parser)

20232m

Consider a grammar $A \to a S_1 | a S_2$ . The left factored grammar produced from the grammar is
(i) $A \to a A', A' \to S_1 | S_2$
(ii) $A' \to a A, A \to a S_1 | a S_2$
(iii) $A \to a A', A' \to S_1 | S_2, S_1 \to S_1, S_2$
(iv) None of these

Search Google Ask AI

Similar questions

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 Compiler DesignConsider the following grammar: S \rightarrow S(S)S/\epsilon (i) Left factor this grammar. (ii) Eliminate left recursion from original grammar. (iii) Is the resulting grammar suitable for top-down parsing?20237m Formal Language & Automata TheoryA _____ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above20202m Formal Language & Automata TheoryA ___________ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above20222m

PreviousLeft factoring guarantees (i) Not occurring of backtracking (ii) Cycle free parse tree (iii) Error free target code (iv) Correct LL(1) parsing table NextSynthesized attributed are calculated (i) From the values of attributes of the children of the node (ii) From the values of attributes of the parent of the node (iii) From the values of attributes of the siblings of the node (iv) None of these