style: minor fixes

* examples/c/README.md: here.
This commit is contained in:
Akim Demaille
2020-03-22 15:04:47 +01:00
parent 2da399d15f
commit 2b63c54f5a
2 changed files with 13 additions and 6 deletions

11
TODO
View File

@@ -1,4 +1,12 @@
* Bison 3.6 * Bison 3.7
** Bistromathic
- Hitting tab on a line with a syntax error is ugly
- Be robust to existing ~/.inputrc
- How about not evaluating incomplete lines when the text is not finished
(as shells do).
** Doc ** Doc
*** api.header.include *** api.header.include
@@ -31,7 +39,6 @@ enough.
*** calc.at *** calc.at
Stop hard-coding "Calc". Adjust local.at (look for FIXME). Stop hard-coding "Calc". Adjust local.at (look for FIXME).
* Bison 3.7
** Counter example generation ** Counter example generation
See https://github.com/akimd/bison/pull/15. See https://github.com/akimd/bison/pull/15.

View File

@@ -32,10 +32,10 @@ The calculator with precedence directives and location tracking. It uses
Flex to generate the scanner. Flex to generate the scanner.
## reccalc - recursive calculator with Flex and Bison ## reccalc - recursive calculator with Flex and Bison
The example builds on top of the previous one to provide a reentrant parser. This example builds on top of the previous one to provide a reentrant
Such parsers can be called concurrently in different threads, or even parser. Such parsers can be called concurrently in different threads, or
recursively. To demonstrate this feature, expressions in parentheses are even recursively. To demonstrate this feature, expressions in parentheses
tokenized as strings, and then recursively parsed from the parser. So are tokenized as strings, and then recursively parsed from the parser. So
`(((1)+(2))*((3)+(4)))` uses eight parsers, with a depth of four. `(((1)+(2))*((3)+(4)))` uses eight parsers, with a depth of four.
## pushcalc - calculator implemented with a push parser ## pushcalc - calculator implemented with a push parser