Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
Using the syntax of C, write a recursive-descent subprogram that corresponds to the following EBNF rule: lt;while loopgt; -gt; while(...
Using the syntax of C, write a recursive-descent subprogram that corresponds to the following EBNF rule:
<while loop> -> while( <condition>) <statement>;
In this rule, ( and ) are not metasymbols. You may assume that the lex function reads a single lexeme, whose token code is left in the nextToken variable. Assume that the codes for the while, left parenthesis, right parenthesis, and semicolon tokens are WHILE_CODE, LEFTPAREN_CODE, RIGHTPAREN_CODE, and SEMICOLON_CODE, respectively. Have your function call the error function if it detects an error.
