BNF in C

-> program -> start stop -> empty | var Identifier = Integer -> . | : Identifier -> + | - | / | * | -> % | -> ( ) | Identifier | Number -> -> empty | -> | | | | | -> read Identifier . -> print . -> iff ( ) -> iter ( ) -> let Identifier = . -> < | < < | > | > > | = = | =

Suppose we want to have functions in this project grammar. A function returns a

number, takes no arguments, and its body is a block. Functions are defined exactly

like variables in the original grammar except that function name is follow by a block.

Show the necessary modifications to your grammar. Is the resulting grammar LL(1)?