| Rev | Author | # | Line |
|---|---|---|---|
| 5 | SamJansen | 1 | Bison is an extremely useful and very fast CompilerCompiler. It takes an [EBNF] grammar, a small snippet of [C]/[C++] code for each rule, and a source of tokens and generates a table based parser. The grammar may not contain right recursive rules. The parser generated is usually paired with a lexer generated by [Flex]. The generated parser is a FiniteStateMachine -- a big function with lots of [GoTo]s. The particular parser type created by Bison is !LALR(1). |
| 1 | PerryLorier | 2 | |
| 5 | SamJansen | 3 | You should investigate [Bison] for any non-trivial parsing tasks. |
| 1 | PerryLorier | 4 | |
| 6 | AristotlePagaltzis | 5 | See also RecursiveDescentParser. |
| 6 | |||
| 1 | PerryLorier | 7 | ---- |
| 2 | AlastairPorter | 8 | CategoryProgrammingLanguages |
lib/blame.php:177: Warning: Invalid argument supplied for foreach()