Given the FSA shown below, construct the corresponding deterministic FSA.
Derive the regular expression for the language accepted by that
FSA.
(Extra credit)
Given a pumping-lemma style argument that the set of palindromes over the alphabet
Σ={a,b} is not a regular language.
Consider the following grammar:
Start -> E $
E -> T + E
| T
T -> T * F
| F
F -> ( E )
| a
Show the leftmost derivation of the string
a + a * a + a
Show the rightmost derivation of the string
a * a + a * a
Describe how this grammar structures expressions (left-associating,
right-associating, precedence).
For each grammar shown below, answer the following.
Is the grammar ambiguous? If so, provide two distinct derivations for
the same input string; if not, describe what makes this grammar unambiguous.