Executable Grammars in Newspeak

Electronic Notes in Theoretical Computer Science

Volumn 193, Issue , 2007, Pages 3-18

  Bracha, Gilad ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

dynamic programming languages; Parser combinators; reflection; Smalltalk

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION DISSEMINATION; PROGRAM PROCESSORS; SPECIFICATION LANGUAGES;

DYNAMIC PROGRAMMING LANGUAGES; EXECUTABLE GRAMMARS; PARSER COMBINATORS; SMALLTALK;

COMPUTATIONAL GRAMMARS;

EID: 35548954582     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.10.004     Document Type: Article

References (21)

1. Lars Bak, Gilad Bracha, Steffen Grarup, Robert Griesemer, David Griswold, and Urs Hölzle. Mixins in Strongtalk, 2002. Invited paper, ECOOP Workshop on Inheritance
2. Andrew Black. Personal communication
3. Black A., Hutchinson N., Jul E., and Levy H. Object structure in the emerald system. Proceedings OOPSLA'86. ACM SIGPLAN Notices 21 11 (November 1986) 78-86
4. Bracha G. Room 101. Blog at. gbracha.blogspot.com
5. Bracha G. Pluggable types. Colloquium at Aarhus University. Slides available at (March 2003). http://bracha.org/pluggable-types.pdf
6. Gilad Bracha and William Cook. Mixin-based inheritance. In Proc. of the Joint ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications and the European Conference on Object-Oriented Programming, October 1990
7. Gilad Bracha and David Griswold. Extending Smalltalk with mixins, September 1996. OOPSLA Workshop on Extending the Smalltalk Language
8. Bryan Ford. Packrat parsing: Simple, powerful, lazy, linear time. In Proc. of the ACM SIGPLAN International Conference on Functional Programming, pages 36-47, September 2002
9. Bryan Ford. Parsing expression grammars: A recognition-based syntactic foundation. In Proc. of the ACM Symp. on Principles of Programming Languages, pages 111-122, January 2004
10. Christian Plesner Hansen. An efficient, dynamically extensible ELL parser library, May 2004. Masters Thesis
11. Hutton G., and Meijer E. Monadic parser combinators 8 (July 1998) 437-444
12. Jparsec library. Available at. http://jparsec.codehaus.org/
13. Daan Leijen and Erik Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-27, Department of Computer Science, Universiteit Utrecht, 2001
14. Adriaan Moors, Frank Piessens, and Martin Odersky. Parser Combinators in Scala. Technical Report CW491, Department of Computer Science, K.U. Leuven, 2007. Under preparation. http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW491.abs.html.
15. Martin Odersky. Scala by example, January 2007
16. Martin Odersky, Philippe Altherr, Vincent Cremet, Iulian Dragos, Gilles Dubochet, Burak Emir, Sean McDirmid, Stéphane Micheloud, Nikolay Mihaylov, Michel Schinz, Lex Spoon, Erik Stenman, and Matthias Zenger. An Overview of the Scala Programming Language (2. edition). Technical report, 2006
17. Simon Peyton Jones (editor). Haskell 98 language and libraries, the revised report, December 2002. Available at http://www.haskell.org/onlinereport/
18. Schaffert C., Cooper T., Bullis B., Killian M., and Wilpolt C. An introduction to trellis/owl. Proceedings OOPSLA'86. ACM SIGPLAN Notices 21 11 (November 1986) 9-16
19. Torgersen M., Plesner Hansen C., Ernst E., von der Ahé P., Bracha G., and Gafter N. Adding wildcards to the Java programming language. Journal of Object Technology 3 11 (December 2004) 97-116. http://www.jot.fm/issues/issue_2004_12/article5 Special issue: OOPS track at SAC 2004, Nicosia/Cyprus
20. David Ungar and Randall Smith. SELF: The power of simplicity. In Proc. of the ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications, October 1987
21. Wadler P. How to replace failure by a list of successes. Proc. of a conference on Functional programming languages and computer architecture. New York, NY, USA (1985), Springer-Verlag New York, Inc. 113-128