New Programmming language Parser, Lexer, Semantic Analyzer

This new programming language compiler is developed by using parsing, lexing, and a semantic analyzer to validate the language rules.

The rules of the language are as follows:

<BODY> -> {<PRINT>';'|<ASSIGNMENT>';'|<VARIABLE>';’|<WHILE>|<IF>|<RETURN>';'}
<ASSIGNMENT> -> identifier '=' <EXPRESSION>
<VARIABLE> -> ('int'|'float'|'boolean'|'char’|'string'|'void')identifier
<WHILE> -> 'while' '(' <EXPRESSION> ')' <PROGRAM>
<IF> -> 'if' '(' <EXPRESSION> ')' <PROGRAM> ['else' <PROGRAM>]
<RETURN> -> 'return'
<PRINT> -> ’print’ ‘(‘ <EXPRESSION> ‘)’
<EXPRESSION> -> <X> {'|' <X>}
<X> -> <Y> {'&' <Y>}
<Y> -> ['!'] <R>
<R> -> <E> {('>'|'<'|'=='|'!=') <E>}
<E> -> <A> {(’+'|'-’) <A>}
<A> -> <B> {('*'|'/') <B>}
<B> -> ['-'] <C>
<C> -> integer | octal | hexadecimal | binary | true | false | string | char | float | identifier|'(' <EXPRESSION> ')

The input code on the left is validated and tokenized into its respective tokens that make up the language.

bturloff/Lexer

New Programmming language Parser, Lexer, Semantic Analyzer

The rules of the language are as follows: