Differences between version 4 and predecessor to the previous major change of Bison.
Other diffs: Previous 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 1 | Last edited on Friday, October 10, 2003 4:56:47 pm | by PerryLorier | Revert |
@@ -1,5 +1,7 @@
-Bison is a
CompilerCompiler. You give Bison a grammer (thats not right recursive) and
a small C
snippet for each rule, and a sorce
of tokens and it will generate you
a table bases
parser.
+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
.
-Bison is extremely useful and very fast. If you have a
non-trivial grammar, you should investigate using Bison for it
.
+You should investigate [
Bison]'s use for any
non-trivial parsing tasks
.
-Bison is normally paired with [Flex]
+See also RecursiveDescentParser
+----
+CategoryProgrammingLanguages
