This assignment implements an LL(1) parser that reads context-free grammar (CFG) and parses input strings using a stack-based simulation of the LL(1) parsing algorithm. The parser reads the grammar ...
Small table-driven LL(1) parser for a left-factored MiniLisp grammar. Includes UTF-8 aware lexer, JSON-style parse tree output, and gtest tests. All operator forms start with a distinct terminal; ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback