Differences between version 4 and previous revision of Bison.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Saturday, October 11, 2003 4:34:19 pm | by StuartYeates | Revert |
| Older page: | version 3 | Last edited on Saturday, October 11, 2003 1:19:05 am | by AristotlePagaltzis | Revert |
@@ -1,6 +1,7 @@
-Bison is an extremely useful and very fast CompilerCompiler. It takes an [EBNF] grammar, a small snippet of [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].
+Bison is an extremely useful and very fast CompilerCompiler. It takes an [EBNF] grammar, a small snippet of [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
.
You should investigate [Bison]'s use for any non-trivial parsing tasks.
+See also RecursiveDescentParser
----
CategoryProgrammingLanguages
