BNF GRAMMAR/PARSE TREE (COMPUTER SCIENCE)

2. [30] Use the following BNF grammar to (a) develop a leftmost derivation for the Identifier, C3PO . (b) develop a rightmost derivation for the Identifier, C3PO. (c) Draw a parse tree for the derivation in (a) (d) Draw a parse tree for the derivation in (b). (e) Draw an abstract syntax tree for (c) (f) Draw an abstract syntax tree for (d) Identifier Letter { Letter Digit} Letter a l b l l z IAIBI IZ Digit-> 0 I 1 I 1 9 Literal Integer \ Boolean \ Float \ Char Integer-> Digit { Digit} Boolean true | false Float-> Integer. Integer Char ' ASCII Char' 2. [30] Use the following BNF grammar to (a) develop a leftmost derivation for the Identifier, C3PO . (b) develop a rightmost derivation for the Identifier, C3PO. (c) Draw a parse tree for the derivation in (a) (d) Draw a parse tree for the derivation in (b). (e) Draw an abstract syntax tree for (c) (f) Draw an abstract syntax tree for (d) Identifier Letter { Letter Digit} Letter a l b l l z IAIBI IZ Digit-> 0 I 1 I 1 9 Literal Integer \ Boolean \ Float \ Char Integer-> Digit { Digit} Boolean true | false Float-> Integer. Integer Char ' ASCII Char