rush Parser

A crate which performs syntactic analysis on rush programs whilst creating an AST.

This crate implements a lexer and a parser for the rush programming language. This parser is a recursive descent parser, meaning it uses a top-down approach. For infix expressions, an operator precedence algorithm is used. The AST generated by this crate is often validated and annotated by the rush-analyzer before being fed into a compiler.