Editing Parsing (section)

=== Implementation ===

A simple parser implementation reads the entire input file, performs an intermediate computation or translation, and then writes the entire output file,
such as in-memory [[multi-pass compiler]]s.

Alternative parser implementation approaches:

* '''push parsers''' call registered handlers ([[Callback (computer programming)|callbacks]]) as soon as the parser detects relevant tokens in the input stream. A push parser may skip parts of the input that are irrelevant (an example is [[Expat (software)|Expat]]).
* '''pull parsers''', such as parsers that are typically used by [[compilers]] front-ends by "pulling" input text.
* '''incremental parsers''' (such as incremental [[chart parser]]s) that, as the text of the file is edited by a user, does not need to completely re-parse the entire file.
* '''Active''' versus '''passive parsers'''<ref>
Patrick Blackburn and Kristina Striegnitz.
[https://cs.union.edu/~striegnk/courses/nlp-with-prolog/html/ "Natural Language Processing Techniques in Prolog"].
</ref><ref>
Song-Chun Zhu.
[http://www.stat.ucla.edu/~sczhu/Courses/UCLA/Stat_232B/Handouts/Ch4_chart_parsing.pdf "Classic Parsing Algorithms"].
</ref>