Back to the 2025 paper
Similar questions
Compiler DesignConsider the following grammar: E \rightarrow E + T | T T \rightarrow T * F | F F \rightarrow (E) | id Is the grammar ambiguous? Justify your answer with proper reasoning.20242m Compiler DesignDiscuss ambiguity in grammar. Show that the given grammar is ambiguous: S \rightarrow ABA A \rightarrow aA \mid \varepsilon B \rightarrow bB \mid \varepsilon20257mCompiler DesignWhen a grammar is called ambiguous? Is there any technique to remove ambiguity? Justify whether the grammar is ambiguous or not? A \to AA | (A) | a20234mFORMAL LANGUAGE & AUTOMATA THEORYShow whether the given grammar is ambiguous: S \to a \mid abSb \mid aAb \\ A \to bS \mid aAAb20227m
PreviousUsing Pumping Lemma, prove that the language L = \{0^{n}1^{n} \mid n \ge 0\} is not regular.NextUsing Pumping Lemma for CFLs, prove that L = \{a^{n}b^{n}c^{n} \mid n \ge 0\} is not context-free.
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.