| Original author(s) | Robert Corbett |
|---|---|
| Developer(s) | Thomas Dickey |
| Initial release | September 2, 1989[1] |
| Stable release | 20240109[2] 
/ 9 January 2024 |
| Repository | |
| Written in | ANSI C89 |
| Operating system | Unix-like |
| Type | Parser generator |
| License | public domain |
| Website | invisible-island |
Berkeley Yacc (byacc) is a Unix parser generator designed to be compatible with Yacc. It was originally written by Robert Corbett and released in 1989.[3] Due to its liberal license and because it was faster than the AT&T Yacc, it quickly became the most popular version of Yacc.[4] It has the advantages of being written in ANSI C89 and being public domain software.
It contains features not available in Yacc, such as reentrancy, which is implemented in a way that is broadly compatible with GNU Bison.[5][6]
- ^ Corbett, Robert (September 2, 1989). "PD LALR(1) parser generator". Newsgroup: comp.compilers. Usenet: [email protected]. Retrieved 2021-09-17.
- ^ "Index of /archives/byacc".
- ^ Doug Brown; John Levine; Tony Mason (October 1992), lex & yacc (2 ed.), O'Reilly Media
- ^ John Levine (August 2009), flex & bison, O'Reilly Media
- ^ "Berkeley Yacc". invisible-island.net. Archived from the original on 2020-10-19. Retrieved 2020-11-10.
...support for reentrant code, which has evolved in byacc to the point where it can be compared and tuned against bison.
- ^ "Berkeley Yacc Change log, see entry "2010-06-07 Andres.Meji"". 2010-06-07. Archived from the original on 2020-11-10. Retrieved 2020-11-10.