Given below are two statements
Statement I: LL(1) and LR are examples of Bottom‐up parsers.
Statement II: Recursive descent parser and SLR are examples of Top‐down parsers In light of the above statements, choose the correct answer from the options given below
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Both Statement I and Statement II are false
Explanation
LL(1) and recursive descent are top-down; LR and SLR are bottom-up. Both statements put a parser in the wrong class, so both are false.
More Theory of Computation and Compilers questions
- Let L = L₁ ∩ L₂, where L₁ = {0ᵐ1ᵐ2 0ⁿ1ⁿ | m, n ≥ 0} and L₂ = {0ᵐ1ⁿ2ᵏ | m, n, k ≥ 0}. Then L is
- Let 1 and 2 be languages over represented by the regular expressions (a∗ + b)∗ (a + b)∗ and respectively. Which of the following is true wi…
- Which of the following statements is true?
- Which of the following is not an intermediate code form?
- Which of the following are applications of symbol table? (A) Storage allocation (B) Checking type compatability (C) Suppressing duplicate e…
- Let G1 and G2 be arbitrary context-free grammars and R an arbitrary regular language. Which problems are undecidable? (A) Is L(G1) = L(G2)?…