Question

Please actually answer it

For both of the following languages, provide a grammar that generates it, an intuitive explanation why this grammar generates this language, and a graphical representation of a push-down automaton that recognizes this language. (a) The language of properly nested sets of parentheses over the alphabet G)). Note that the string (COO))) belongs to this language, while the string (O) () does not because the third closing parenthesis does not have a matching opening parenthesis. Provide a parse tree and a leftmost derivation of the string (COO)O). (b) The language of all strings over the alphabet (a, b, c) that are not palindromes, that is, are not of the form σαο", where e* is the reversal of string σ and α e {a,b,c,e) Thus, the string abb belongs to this language, while the string abcba does not. Provide a parse tree and a rightmost derivation for the string abacbba.

Answer 1

CS) s (S)S ) CS)

nlike fin>te State Auomata, Push >own Auomata oS- to Sio1e. A ShaCK downs tbasic opexatons? Qj>--> C ao Canb e ushed onio the Sumbo n nanS hS Pishe ss nonedand Poped

e, b/ b