Assignment $2$

Write a regular expression for Java identifiers consisting of letters, digits, $$,$ and the

underscore character $\text{'}{?}_{?},$ and starting with a letter, $ or underscore.

Write EBNF descriptions for the Java class definition header statement.

Rewrite the BNF below to give $+$ precedence over $*$ and force $+$ to be right

associative.

$=$

$A|B|C$

$+$

$|||$

$*$

$1$

$$ factor $>()$

$|||$

Write a grammar for the language consisting of strings that have $n$ copies of the

letter a followed by one more number of copies of the letter $b,$ where $n>0.$ For

example, the strings abb, aaaabbbbb, and aaaaaaaabbbbbbbbb are in the language

but a$,$ ab$,$ ba$,$ and aaabb are not.

Draw parse trees for the sentences abb and aabbb, as derived from the grammar of

Problem $2.$

Using the grammar below, show a parse tree and a leftmost derivation for the

following statement: $a,A=A**(B+(C**A))$