Implement part of a recursive descent parser for a simple set of language rules. Use any programming language for the implementation; if it isnt a common language, please make a note of which language it is in a comment. You should implement functions for each of the nonterminal symbols and, using the following rules that describe part of a C-like language.

--> if(){} [else {}]

--> == | !=

You may assume the following functions:

- lex(), a lexical analyser which places a code for the next token in the global variable next token

- stmts()

- value()

Terminal symbols should be encoded with the following defined constants:

- CODE LP for (

- CODE RP for )

- CODE LB for {

- CODE RB for {

- CODE EQ for ==

- CODE NEQ for !=

- CODE IF for if

- CODE ELSE for else