byacc

Berkeley Yacc is a parser generator that uses LALR(1) algorithm, which makes it highly efficient in parsing input specifications. It has been designed to be as compatible as possible with AT&T Yacc, so users familiar with the latter won't find it challenging to switch to Berkeley Yacc.

One notable feature of Berkeley Yacc is its ability to accept any input specification that complies with AT&T Yacc documentation. However, it's important to note that specifications using undocumented features of AT&T Yacc may not be accepted.

Users of Berkeley Yacc should be aware that it's distributed without any warranty whatsoever. The code may contain errors, and neither the author nor any contributor takes responsibility for any consequences of its use.

Berkeley Yacc is in the public domain, which means that anyone may distribute the source or binary forms whether unchanged or modified. Distributors are also allowed to charge any fees for Berkeley Yacc.

Finally, programs generated by Berkeley Yacc may be distributed freely, making it an excellent tool for developers seeking flexibility and efficiency in parsing input specifications.