style: minor fixes
Akim Demaille <[email protected]>
| Newsgroups | gmane.comp.parsers.bison.bugs |
|---|---|
| Message-ID | <[email protected]> |
commit 2ab4058de09d9f000d5f58bd058ced58f0160e7a Author: Akim Demaille <[email protected]> Date: Sun Mar 22 15:04:47 2020 +0100 style: minor fixes * examples/c/README.md: here. diff --git a/TODO b/TODO index 38977790..006284eb 100644 --- a/TODO +++ b/TODO @@ -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 *** api.header.include @@ -31,7 +39,6 @@ enough. *** calc.at Stop hard-coding "Calc". Adjust local.at (look for FIXME). -* Bison 3.7 ** Counter example generation See https://github.com/akimd/bison/pull/15. diff --git a/examples/c/README.md b/examples/c/README.md index 0d8031c3..2eb60449 100644 --- a/examples/c/README.md +++ b/examples/c/README.md @@ -32,10 +32,10 @@ The calculator with precedence directives and location tracking. It uses Flex to generate the scanner. ## reccalc - recursive calculator with Flex and Bison -The example builds on top of the previous one to provide a reentrant parser. -Such parsers can be called concurrently in different threads, or even -recursively. To demonstrate this feature, expressions in parentheses are -tokenized as strings, and then recursively parsed from the parser. So +This example builds on top of the previous one to provide a reentrant +parser. Such parsers can be called concurrently in different threads, or +even recursively. To demonstrate this feature, expressions in parentheses +are tokenized as strings, and then recursively parsed from the parser. So `(((1)+(2))*((3)+(4)))` uses eight parsers, with a depth of four. ## pushcalc - calculator implemented with a push parser