Shift-reduce parser consists of
(a) input buffer
(b) stack
(c) parse table
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. (a), (b) and (c)
Explanation
A shift-reduce (LR) parser uses an input buffer, a stack and a parsing table.
More Theory of Computation and Compilers questions
- How many states are there in a minimum state automata equivalent to regular expression given below? a * b(a + b) Regular expression is
- Match List I with List II, where L1 is regular, L2 context-free, L3 recursive and L4 recursively enumerable. List I: (a) complement(L3) ∪ L…
- How can the decision algorithm be constructed L for deciding whether context-free language is finite? CFGG (a) By constructing redundant in…
- Consider the following grammar : S → XY X → Y aY ∣ a and Y → bbX Which of the following statements is/are true about the above grammar? (a)…
- Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing M machine ? G L(G) = ϕ (a) is a CFG with M M…
- For a statement L ⊆ Σ∗ A language is recursive if there exists M some turing machine . Which of the following conditions is satisfied for ω…