Haoyuan Zhang
ABSTRACT
Over the years a lot of effort has been put on solving extensibility problems, while retaining important software engineering properties such as modular type-safety and separate compilation. Most previous work focused on operations that traverse and process extensible Abstract Syntax Tree (AST) structures. However, there is almost no work on operations that build such extensible ASTs, including parsing.
This paper investigates solutions for the problem of modular parsing. We focus on semantic modularity and not just syntactic modularity. That is, the solutions should not only allow complete parsers to be built out of modular parsing components, but also enable the parsing components to be modularly type-checked and separately compiled. We present a technique based on parser combinators that enables modular parsing. Interestingly, the modularity requirements for modular parsing rule out several existing parser combinator approaches, which rely on some non-modular techniques. We show that Packrat parsing techniques, provide solutions for such modularity problems, and enable reasonable performance in a modular setting. Extensibility is achieved using multiple inheritance and Object Algebras. To evaluate the approach we conduct a case study based on the 'Types and Programming Languages' interpreters. The case study shows the effectiveness at reusing parsing code from existing interpreters, and the total parsing code is 69% shorter than an existing code base using a non-modular parsing approach.
Supplemental Material
Available for Download
- Sven Apel and Christian Kastner. 2009. An Overview of Feature-Oriented Software Development. Journal of Object Technology 8, 5 (2009), 49-84.Google Scholar
Cross Ref
- Patrick Bahr. 2014. Composing and decomposing data types: a closed type families implementation of data types a la carte. In Proceedings of WGP 2014. 71-82. Google ScholarDigital Library
- Patrick Bahr and Tom Hvitved. 2011. Compositional data types. In Proceedings of WGP@ICFP 2011. 83-94. Google ScholarDigital Library
- Eric Beguet and Manohar Jonnalagedda. 2014. Accelerating Parser Combinators with Macros. In Proceedings of SCALA 2014. 7-17. Google ScholarDigital Library
- Gilad Bracha and William R. Cook. 1990. Mixin-based Inheritance. In Proceedings of OOPSLA/ECOOP 1990. 303-311. Google ScholarDigital Library
- Martin Bravenboer and Eelco Visser. 2008. Parse Table Composition. In Proceedings of SLE 2008. 74-94.Google Scholar
- William H. Burge. 1975. Recursive programming techniques. Addison-Wesley Longman, Incorporated.Google Scholar
- William R. Cook. 1989. A Denotational Semantics of Inheritance. Ph.D. Dissertation. Brown University. Google ScholarDigital Library
- Bruno C. d. S. Oliveira. 2009. Modular Visitor Components. In Proceedings of ECOOP 2009. 269-293. Google ScholarDigital Library
- Bruno C. d. S. Oliveira and William R. Cook. 2012. Extensibility for the Masses - Practical Extensibility with Object Algebras. In Proceedings of ECOOP 2012. 2-27. Google ScholarDigital Library
- Bruno C. d. S. Oliveira, Shin-Cheng Mu, and Shu-Hung You. 2015. Modular reifiable matching: a list-of-functors approach to two-level types. In Proceedings of Haskell 2015. 82-93. Google ScholarDigital Library
- Bruno C. d. S. Oliveira, Tijs van der Storm, Alex Loh, and William R. Cook. 2013. Feature-Oriented Programming with Object Algebras. In Proceedings of ECOOP 2013. 27-51. Google ScholarDigital Library
- Torbjorn Ekman and Gorel Hedin. 2007. The jastadd extensible java compiler. In Proceedings of OOPSLA 2007. 1-18. Google ScholarDigital Library
- Sebastian Erdweg, Tillmann Rendel, Christian Kastner, and Klaus Ostermann. 2011. SugarJ: library-based syntactic language extensibility. In Proceedings of OOPSLA 2011. 391-406. Google ScholarDigital Library
- Erik Ernst. 2001. Family Polymorphism. In Proceedings of ECOOP 2001. 303-326. Google ScholarDigital Library
- Erik Ernst, Klaus Ostermann, and William R. Cook. 2006. A virtual class calculus. In Proceedings of POPL 2006. 270-282. Google ScholarDigital Library
- Martin Odersky et al. 2004. An Overview of the Scala Programming Language. Technical Report IC/2004/64. EPFL Lausanne, Switzerland.Google Scholar
- Sebastian Erdweg et al. 2015. Evaluating and comparing language workbenches: Existing results and benchmarks for the future. Computer Languages, Systems & Structures 44 (2015), 24-47. Google ScholarDigital Library
- Bryan Ford. 2002. Packrat parsing: : simple, powerful, lazy, linear time, functional pearl. In Proceedings of ICFP 2002. 36-47. Google ScholarDigital Library
- Richard A. Frost, Rahmatullah Hafiz, and Paul Callaghan. 2008. Parser Combinators for Ambiguous Left-Recursive Grammars. In Proceedings of PADL 2008. 167-181. Google ScholarDigital Library
- Erich Gamma. 1995. Design patterns: elements of reusable object-oriented software. Pearson Education India. Google ScholarDigital Library
- Brian Goetz and Robert Field. 2012. Featherweight Defenders: A formal model for virtual extension methods in Java. Oracle Corporation, Mar 27 (2012), 9.Google Scholar
- Maria Gouseti, Chiel Peters, and Tijs van der Storm. 2014. Extensible language implementation with object algebras (short paper). In Proceedings of GPCE 2014. 25-28. Google ScholarDigital Library
- Robert Grimm. 2006. Better extensibility through modular syntax. In Proceedings of PLDI 2006. 38-51. Google ScholarDigital Library
- Jan Heering, Paul Robert Hendrik Hendriks, Paul Klint, and Jan Rekers. 1989. The syntax definition formalism SDF. ACM Sigplan Notices 24, 11 (1989), 43-75. Google ScholarDigital Library
- Graham Hutton and Erik Meijer. 1996. Monadic parser combinators. Technical Report NOTTCS-TR-96-4. University of Nottingham, University of Nottingham. http://eprints.nottingham.ac.uk/237/Google Scholar
- Christian Kastner, Sven Apel, and Klaus Ostermann. 2011. The road to feature modularity?. In Proceedings of SPLC 2011. 5:1-5:8. Google ScholarDigital Library
- Daan Leijen and Erik Meijer. 2001. Parsec: Direct Style Monadic Parser Combinators For The Real World. Technical Report UU-CS-2001-3. Department of Information and Computing Sciences, Utrecht University.Google Scholar
- M. Douglas McIlroy. 1968. Mass Produced Software Components. Report on a Conference of the Nato Science Committee. (1968), 135-150 pages.Google Scholar
- Matthew Might, David Darais, and Daniel Spiewak. 2011. Parsing with derivatives: a functional pearl. In Proceeding of ICFP 2011. 189-195. Google ScholarDigital Library
- Adriaan Moors, Frank Piessens, and Martin Odersky. 2008. Parser combinators in Scala. (2008).Google Scholar
- Nathaniel Nystrom, Michael R. Clarkson, and Andrew C. Myers. 2003. Polyglot: An Extensible Compiler Framework for Java. In Proceedings of CC 2003. 138-152. Google ScholarDigital Library
- Martin Odersky and Matthias Zenger. 2005. Independently extensible solutions to the expression problem. In Proceeding of FOOL 2015.Google Scholar
- Cyrus Omar, Darya Kurilova, Ligia Nistor, Benjamin Chung, Alex Potanin, and Jonathan Aldrich. 2014. Safely Composable Type-Specific Languages. In Proceedings of ECOOP 2014. 105-130. Google ScholarDigital Library
- Terence John Parr and Russell W Quong. 1995. ANTLR: A predicated-LL(K) Parser Generator. Softw. Pract. Exper. 25, 7 (July 1995), 789-810. Google ScholarDigital Library
- Benjamin C Pierce. 2002. Types and programming languages. MIT press. Google ScholarDigital Library
- Nathanael Scharli, Stephane Ducasse, Oscar Nierstrasz, and Andrew P. Black. 2003. Traits: Composable Units of Behaviour. In Proceedings of ECOOP 2003. 248-274.Google Scholar
- August Schwerdfeger and Eric VanWyk. 2009. Verifiable Composition of Deterministic Grammars. In Proceedings of PLDI 2009. 199-210. Google ScholarDigital Library
- August Schwerdfeger and Eric Van Wyk. 2009. Verifiable Parse Table Composition for Deterministic Parsing. In Proceedings of SLE 2009. 184-203. Google ScholarDigital Library
- Anthony M. Sloane and Matthew Roberts. 2015. Oberon-0 in Kiama. Science of Computer Programming 114 (2015), 20-32. Google ScholarDigital Library
- Wouter Swierstra. 2008. Data types a la carte. Journal of functional programming 18, 04 (2008), 423-436. Google ScholarDigital Library
- Sam Tobin-Hochstadt, Vincent St-Amour, Ryan Culpepper, Matthew Flatt, and Matthias Felleisen. 2011. Languages as libraries. In Proceedings of PLDI 2011. 132-141. Google ScholarDigital Library
- Mads Torgersen. 2004. The Expression Problem Revisited. In Proceedings of ECOOP 2004. 123-143.Google ScholarCross Ref
- Marcos Viera, Doaitse Swierstra, and Atze Dijkstra. 2012. Grammar Fragments Fly First-class. In Proceedings of LDTA 2012. 5:1-5:7. Google ScholarDigital Library
- Eelco Visser. 2001. Stratego: A Language for Program Transformation Based on Rewriting Strategies. In Proceedings of RTA 2001. 357-362. Google ScholarDigital Library
- Philip Wadler. 1985. How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages. In Proceedings of Functional Programming Languages and Computer Architecture, 1985. 113-128. Google ScholarDigital Library
- Philip Wadler. 1998. The expression problem. Java-genericity mailing list (1998).Google Scholar
- YanlinWang and Bruno C. d. S. Oliveira. 2016. The expression problem, trivially!. In Proceedings of Modularity 2016. 37-41. Google ScholarDigital Library
- Alessandro Warth, James R. Douglass, and Todd D. Millstein. 2008. Packrat parsers can support left recursion. In Proceedings of PEPM 2008. 103-110. Google ScholarDigital Library
- Alessandro Warth, Patrick Dubroy, and Tony Garnock-Jones. 2016. Modular semantic actions. In Proceedings of DLS 2016. 108-119. Google ScholarDigital Library
- Haoyuan Zhang, Zewei Chu, Bruno C. d. S. Oliveira, and Tijs van der Storm. 2015. Scrap your boilerplate with object algebras. In Proceedings of OOPSLA 2015. 127-146. Google ScholarDigital Library
Index Terms
- Type-safe modular parsing
Recommendations
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88: Proceedings of the 26th annual meeting on Association for Computational LinguisticsWe will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and Joshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Modular interpreters for the masses: implicit context propagation using object algebras
GPCE '15Modular interpreters have the potential to achieve component-based language development: instead of writing language interpreters from scratch, they can be assembled from reusable, semantic building blocks. Unfortunately, traditional language ...
Comments