All Questions
Tagged with parsing graph-algorithms
1 question
0
votes
1
answer
260
views
Can abstract syntax trees be unparsed in subexponential time?
Abstract problem description
The way I see it, unparsing means to create a token stream from an AST, which when parsed again produces an equal AST, i.e. ...
- 119