Open sillydan1 opened 1 year ago
Not related but to not open an issue for it:
I just added this project grammar/lexer to my online yacc/lex editor/tester at https://mingodad.github.io/parsertl-playground/playground/ , select Expr-lang parser
from Examples
then click Parse
to see the parser tree.
Any feedback is welcome !
Also I replaced the right recursion by left recursion on rule statements
.
Interesting project :smile: it's a good resource to have for testing the grammar
Is there a specific reason to prefer left recursion over right recursion?
LALR parser can exaust the internal stack when using right recursion also the parser tree goes deeper with right recursion, see here https://www.gnu.org/software/bison/manual/bison.html#Recursion .
Z3 Prover is nice and all, but more choices are always good.
It should be fairly straight forward to implement another driver that utilizes the C++ interface for minisat.
Take a look at this as a possibility