Differences between current version and previous revision of Bison.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 7 | Last edited on Friday, October 24, 2003 8:08:04 am | by CraigBox | |
| Older page: | version 6 | Last edited on Sunday, October 12, 2003 1:20:36 am | by AristotlePagaltzis | Revert |
@@ -1,8 +1,8 @@
-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).
+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).
You should investigate [Bison] for any non-trivial parsing tasks.
See also RecursiveDescentParser.
----
CategoryProgrammingLanguages
