GoConqr has a new look! Let us know what you think.

Sign up free

Quiz

Untitled

Austin Stockhecke 10 questions

Take the quiz

Questions in this quiz (10)

  1. 1A bottom up parser generates
    1. ARight most derivation
    2. BRightmost derivation in reverse
    3. CLeftmost derivation
    4. DLeftmost derivation in reverse
  2. 2If a state does not know whether it will make a shift operation or reduction for a terminal it is called
    1. AShift/reduce conflict
    2. BReduce/shift conflict
    3. CShift conflict
    4. DReduce conflict
  3. 3When there is a reduce/reduce conflict?
    1. Aif a state does not know whether it will make a shift operation using the production rule i or j for a terminal
    2. Bif a state does not know whether it will make a shift or reduction operation during the production rule i or j for a terminal.
    3. Cif a state does not know whether it will make a reduction operation using the production rule i or j for a terminal
    4. DNone of the mentioned
  4. 4For LR(1) item [A -> b., a] the reduction by A->b is done
    1. AIf next symbol is a terminal
    2. BOnly If the next input symbol is a
    3. COnly if the next input symbol is A
    4. DOnly if the next input symbol is b
  5. 5LR parsers are attractive because
    1. AIt can be constructed to recognize CFG corresponding to almost all programming constructs
    2. BIt does not backtrack
    3. CBoth of the mentioned
    4. DNone of the mentioned
  6. 6Which of the following bottom parsing techniques are the most powerful one?
    1. ALR(0)
    2. BSLR(1)
    3. CLR(1)
    4. DLALR(1)
  7. 7Which of the following states in LR(0) automaton indicates a shift/reduce conflict?
    1. AA -> a.b and B -> a.B
    2. Ba -> ab. and B -> b.
    3. Ca -> a.B and B -> b.
    4. DA -> a.b(beta) and B -> (beta).
  8. 8Which of the following states in LR(0) automaton indicates a reduce/reduce conflict
    1. AA -> a.b and B -> a.B
    2. BA -> ab. and B -> b.
    3. CA -> a.B and B -> b.
    4. DA -> a.b(beta) and B -> (beta).
  9. 9Which of the following states in LR(1) automaton indicates a shift/reduce conflict?
    1. A[A -> a.b, b] and [A -> a.B, b]
    2. B[A -> a.b, a] and [A -> b.a, b]
    3. C[A -> a.b, b] and [B -> .b, b]
    4. D[A -> a.b(beta), $] and [B -> (beta)., b]
  10. 10Which of the following states in LI(1) automaton indicates a reduce/reduce conflict?
    1. A[A -> a., a] and [A -> (beta)., b]
    2. B[A -> a., b] and [A -> (beta)., a]
    3. C[A -> a., b] and [B -> (beta)., b]
    4. D[A -> a., $] and [B -> (beta)., a]

Information

Description
Quiz on Untitled, created by Austin Stockhecke on 28/11/2018.
Language
English
Views
18
Rating
No ratings yet
Rate this quiz
Rate this quiz

Feedback

What is it about?

What do you think of the new look?

How do you like it?