aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Compiler Design
  • The grammar
Multiple choice

The grammar

  1. is ambiguous

  2. is unambiguous

  3. cannot be decided

  4. generates two parse trees for one input string

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Every SLR(1) grammar is unambiguous.

Keep practicing — related questions

  • Consider the following statements. (i) Every SLR (1) grammar is unambiguous (ii) There are many unambiguous...
  • The grammar E $\rightarrow$E + E |E*E|(E)| id is
  • Consider the following statements about the context free grammar G = {S $\rightarrow$ SS, S $\rightarrow$ a...
  • Consider the following statements about the context free grammar G = {S $\rightarrow$ SS, S $\rightarrow$ a...
  • Consider the following grammar: S$\rightarrow$SS S$\rightarrow$0 S$\rightarrow$$\epsilon$ Which of the foll...
  • Find the false statement.
  • Which of the following allows the user to specify a possibly ambiguous grammar along with precedence and as...
  • Assume that the SLR parser for a grammar G has n1 states and the LALR parser for that grammar has n2 states...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy