Question
PRINCIPLES OF PROGRAMMING LANGUAGES 1. Consider the grammar G below. For each string, determine whether the string is part of L(G). If it is in
PRINCIPLES OF PROGRAMMING LANGUAGES
1. Consider the grammar G below. For each string, determine whether the string is part of L(G). If it is in L(G), prove it by giving a parse tree. If the parse is ambiguous, prove that by giving two parse trees. If the string is not in L(G), explain why not (one sentence should be sufficient). Start symbol S S ::= < S >| S & S | N N ::= C | C N C ::= x | y | z (a) (b) <&z&y&x> (c) > (d) y&yy&yyy (e) < 2. Rewrite G so that it is not ambiguous. 3. Write a regular expression for the language over alphabet {a, b, c} containing all strings with no more than two as. 4. Write a grammar for the same language. Indicate whether your grammar is ambiguous and briefly give your reasoning
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started