Question
The following grammar is $S \rightarrow A a A b / B b B a$$A \rightarrow \varepsilon$$B \rightarrow \varepsilon$(A) LL (1)(B) Not LL (1)(C) Recursive(D) Ambiguous
Step 1
LL(1) stands for Left to Right, Leftmost derivation with a Lookahead of 1. It is a type of parser that is used to parse context-free grammars. The LL(1) parser reads the input from left to right and constructs a leftmost derivation of the input. It uses a single Show more…
Show all steps
Your feedback will help us improve your experience
James Kiss and 71 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of following grammars are unambiguous? (A) $S \rightarrow(S) S|[S] S| \varepsilon$ (B) $S \rightarrow S(S) S \mid \varepsilon$ (C) $S \rightarrow a S|S a| a$ (D) $S \rightarrow a|S a| b S S|S s b| S b S$
Databases
File Management
Select the correct alternative from the given choices. Which of following grammars are unambiguous? (A) $S \rightarrow(S) S|[S] S| \varepsilon$ (B) $S \rightarrow S(S) S \mid \varepsilon$ (C) $S \rightarrow a S|S a| a$ (D) $S \rightarrow a|S a| b S S|S s b| S b S$
Theory of Computation
Finite Automata and Regular Languages
The R.E $L(r)=\left(a^{+} b^{*}\right) U \varepsilon$. Is the grammar with productions generated over non-terminals $\{S, A\}$ ambiguous? (A) Yes (B) No (C) Can't be determined (D) None
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD