On the Complexity and Performance of Parsing with Derivatives · HackerPapers discussions

On the Complexity and Performance of Parsing with Derivatives — mentioned by 1letterunixname

Thu, 04 May 2023 17:34:58 GMT

There is more to translation of text to AST than parsing and lexing. There are semantic checks. In addition, most languages are not CFG and require nested contexts. "#{"\tThis is some #{'damn'} string".to_upper_case + " hello"}\n" Also, there are lexerless parsers such as derivative parsing that can be combined together and don't produce a stream of tokens. https://dl.acm.org/doi/10.1145/2034773.2034801 https://arxiv.org/pdf/1604.04695.pdf

Paper and discussion history. A mention is not an endorsement.

On the Complexity and Performance of Parsing with Derivatives — mentioned by dfeojm-zlib

Wed, 17 Jul 2019 23:41:53 GMT

Neat. Has anyone seen Parsing with Derivatives (2011) ? https://youtu.be/WPde6DDLtXg http://matt.might.net/papers/might2011derivatives.pdf https://blog.klipse.tech/clojure/2016/10/02/parsing-with-der... https://elfsternberg.com/2018/01/24/parsing-derivatives-naiv... https://news.ycombinator.com/item?id=11976769 (2016) https://arxiv.org/abs/1604.04695 (2016)

Paper and discussion history. A mention is not an endorsement.

On the Complexity and Performance of Parsing with Derivatives — HN submission

Sat, 25 Jun 2016 16:03:03 GMT

On the Complexity and Performance of Parsing with Derivatives

182 points; 114 discussion replies on HN. Paper and source history. A submission is not an endorsement.