I think that state matching is the only correct strategy for incremental node reuse that is compatible with the new error recovery algorithm. It's also simpler than the sentential-form algorithm. With the compressed parse tables, state matching shouldn't be too conservative of a test. |
||
|---|---|---|
| .. | ||
| document_spec.cc | ||
| node_spec.cc | ||
| parser_spec.cc | ||
| stack_spec.cc | ||
| tree_spec.cc | ||