The current implementation will perform a complete copy of all parsed tokens so far before parsing a new one. This scales exponentially, and is mostly pointless, as the copy is only used in case of a parsing error; and the state could be manually reversed given the current implementation.
This could heavily improve on the performance of CPD when running with the --skip-lexical-errors option, as well as heavily reduce the memory footprint for such runs.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4