Berkeley Yacc

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Berkeley Yacc (byacc) is a reimplementation of the Unix parser generator Yacc, originally written by Robert Corbett in 1990, designed for compatibility with Yacc.[1] Due to its liberal license and because it was faster than the AT&T Yacc, it quickly became the most popular version of Yacc.[2] It has the advantages of being written in ANSI C 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 bison.[3][4]

See also[edit]

References[edit]

  1. ^ Doug Brown; John Levine; Tony Mason (October 1992), lex & yacc (2 ed.), O'Reilly Media 
  2. ^ John Levine (August 2009), flex & bison, O'Reilly Media 
  3. ^ "Berkeley Yacc". "...support for reentrant code, which has evolved in byacc to the point where it can be compared and tuned against bison." 
  4. ^ Berkeley Yacc Change log, see entry "2010-06-07 Andres.Meji"

External links[edit]