Differences between version 3 and revision by previous author of Bison.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Saturday, October 11, 2003 1:19:05 am | by AristotlePagaltzis | Revert |
| Older page: | version 2 | Last edited on Friday, October 10, 2003 10:08:25 pm | by AlastairPorter | Revert |
@@ -1,7 +1,6 @@
-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]
.
-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]
----
-CategoryProgrammingLanguages <-yes?
+CategoryProgrammingLanguages
