Timeline for One data structure to both parse and stringify
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2018 at 21:14 | history | edited | Doc Brown | CC BY-SA 4.0 |
deleted 9 characters in body
|
| May 28, 2018 at 19:22 | comment | added | unified modeling sandwich | Non-terminal nodes of parse trees contain essential parts of the original input, such as operators. They need to be stringified as well. You're describing a token list, not a parse tree. And most of the time, grammars allow for different inputs to result in the same parse tree, so the grammar itself (plus lexer information) cannot be used to re-stringify without additional information, at that was the original question. | |
| May 24, 2018 at 18:07 | history | edited | Doc Brown | CC BY-SA 4.0 |
added 25 characters in body
|
| May 24, 2018 at 17:44 | vote | accept | Lance Pollard | ||
| May 24, 2018 at 6:30 | history | answered | Doc Brown | CC BY-SA 4.0 |