
2. Using the syntax of C, write a recursive descent subprogram that corresponds to the following EBNF production: <init-declarator list> → <declarator> [ = <initializer>] ● <declarator> [ = <initializer>]} .L] are metasymbols. Assume that the token codes for-and comma are EQUAL_CODE and COMMA_CODE, respectively. Also, assume that recursive-descent subprograms named declarator and initializer already exist. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .