Use any programming language you prefer to write a recursive-descent parser that parses the language generated by the following EBNF descriptions. Your parser should detect whether or not the input program has any syntax errors. It does not have to specify what and where the error is.
→ begin end
→ {;}
→ |
→ =
→ identifier (An identifier is a string that begins with a letter followed by 0 or more letters and digits)
→ { (+|-) }
→ while ()
→ (< | >) (Assume that logic expressions have only less than or greater than operators)