Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars-Reference-Cited by-同舟云学术

Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars

Published:2011 Issue: Volume: Page:103-118
ISSN:0302-9743
Container-title:Certified Programs and Proofs
language:
Short-container-title:

Author:

Ridge Tom

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25379-9_10

Reference16 articles.

1. Happy, a parser generator for Haskell, http://www.haskell.org/happy/

2. Lecture Notes in Computer Science;A. Barthwal,2009

3. Danielsson, N.A.: Total parser combinators. In: Hudak, P., Weirich, S. (eds.) ICFP, pp. 285–296. ACM (2010)

4. Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94–102 (1970)

5. Ford, B.: Packrat parsing: simple, powerful, lazy, linear time, functional pearl. In: ICFP 2002: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, New York, NY, USA, vol. 37/9, pp. 36–47. ACM (2002)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Derivative-based Parser Generator for Visibly Pushdown Grammars;ACM Transactions on Programming Languages and Systems;2023-05-15

2. Verified ALL(*) Parsing with Semantic Actions and Dynamic Input Validation;Lecture Notes in Computer Science;2023

3. Verbatim++: verified, optimized, and semantically rich lexing with derivatives;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11

4. CoStar: a verified ALL(*) parser;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

5. Automatic Generation and Validation of Instruction Encoders and Decoders;Computer Aided Verification;2021