References

  1. Michael D. Adams, Celeste Hollenbeck & Matthew Might (2016): On the Complexity and Performance of Parsing with Derivatives. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '16. ACM, New York, NY, USA, pp. 224–236, doi:10.1145/2980983.2908128.
  2. Ralph Becket & Zoltan Somogyi (2008): DCGs + Memoing = Packrat Parsing but Is It Worth It?, pp. 182–196. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/978-3-540-77442-6_13.
  3. Jonathan Immanuel Brachthäuser, Tillmann Rendel & Klaus Ostermann (2016): Parsing with First-class Derivatives. In: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016. ACM, New York, NY, USA, pp. 588–606, doi:10.1145/3022671.2984026.
  4. Janusz A Brzozowski (1964): Derivatives of regular expressions. Journal of the ACM (JACM) 11(4), pp. 481–494, doi:10.1145/321239.321249.
  5. Nils Anders Danielsson (2010): Total Parser Combinators. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP '10. ACM, New York, NY, USA, pp. 285–296, doi:10.1145/1932681.1863585.
  6. Bryan Ford (2002): Packrat Parsing: a Practical Linear-Time Algorithm with Backtracking. Massachusetts Institute of Technology, doi:10.1145/581478.581483.
  7. Bryan Ford (2004): Parsing expression grammars: a recognition-based syntactic foundation. In: ACM SIGPLAN Notices 39(1). ACM, pp. 111–122, doi:10.1145/982962.964011.
  8. Fritz Henglein & Ulrik Terp Rasmussen (2017): PEG Parsing in Less Space Using Progressive Tabling and Dynamic Analysis. In: Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017. ACM, New York, NY, USA, pp. 35–46, doi:10.1145/3018882.3018889.
  9. Kimio Kuramitsu (2015): Packrat Parsing with Elastic Sliding Window. Journal of Information Processing 23(4), pp. 505–512, doi:10.2197/ipsjjip.23.505.
  10. Nicolas Laurent & Kim Mens (2015): Parsing Expression Grammars Made Practical. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, SLE 2015. ACM, New York, NY, USA, pp. 167–172, doi:10.1145/2814251.2814265.
  11. Sérgio Medeiros & Roberto Ierusalimschy (2008): A Parsing Machine for PEGs. In: Proceedings of the 2008 Symposium on Dynamic Languages, DLS '08. ACM, New York, NY, USA, pp. 2:1–2:12, doi:10.1145/1408681.1408683.
  12. Sérgio Medeiros, Fabio Mascarenhas & Roberto Ierusalimschy (2014): Left recursion in parsing expression grammars. Science of Computer Programming, doi:10.1016/j.scico.2014.01.013.
  13. Matthew Might, David Darais & Daniel Spiewak (2011): Parsing with Derivatives: A Functional Pearl. In: ACM SIGPLAN Notices 46(9). ACM, pp. 189–195, doi:10.1145/2034574.2034801.
  14. Kota Mizushima, Atusi Maeda & Yoshinori Yamaguchi (2010): Packrat parsers can handle practical grammars in mostly constant space. In: Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. ACM, pp. 29–36, doi:10.1145/1806672.1806679.
  15. Aaron Moss: Egg. https://github.com/bruceiv/egg/tree/deriv.
  16. Roman R Redziejowski (2007): Parsing expression grammar as a primitive recursive-descent parser with backtracking. Fundamenta Informaticae 79(3-4), pp. 513–524.
  17. Roman R Redziejowski (2016): Cut points in PEG. Fundamenta Informaticae 143(1-2), pp. 141–149, doi:10.3233/FI-2016-1308.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org