CL-Yacc is a parser generator for Common Lisp. It operates similar to Yacc tools such as AT&T Yacc, Berkeley Yacc, GNU Bison, Zebu, etc. It uses LALR(1) to create syntax analyzer programs for complicated grammatical structures.
If you're in the market for a LALR(1) parser generator for Common Lisp, CL-Yacc is an excellent option to consider. It's similar in functionality to other popular options such as AT&T Yacc, Berkeley Yacc, GNU Bison, Zebu, lalr.cl, or lalr.scm.
One of the standout features of CL-Yacc is that it's based on the algorithm developed by Aho and Ullman, which also powers AT&T Yacc, Berkeley Yacc, and Zebu. It's worth noting that CL-Yacc doesn't use the faster algorithm created by DeRemer and Pennello, which is used by Bison and lalr.scm (although it's important to differentiate between lalr.cl and lalr.scm).
While CL-Yacc hasn't undergone extensive testing, it's been used successfully for compiling a grammar for a superset of "C" (with over 400 productions) that parses thousands of lines of code on a regular basis. Ultimately, if you're in the market for a feature-packed parser generator for Common Lisp, CL-Yacc is definitely worth considering.
One of the standout features of CL-Yacc is that it's based on the algorithm developed by Aho and Ullman, which also powers AT&T Yacc, Berkeley Yacc, and Zebu. It's worth noting that CL-Yacc doesn't use the faster algorithm created by DeRemer and Pennello, which is used by Bison and lalr.scm (although it's important to differentiate between lalr.cl and lalr.scm).
While CL-Yacc hasn't undergone extensive testing, it's been used successfully for compiling a grammar for a superset of "C" (with over 400 productions) that parses thousands of lines of code on a regular basis. Ultimately, if you're in the market for a feature-packed parser generator for Common Lisp, CL-Yacc is definitely worth considering.
What's New
Version 0.3: N/A