Practical Dynamic Grammars for Dynamic Languages
Document type :
Communication dans un congrès avec actes
Title :
Practical Dynamic Grammars for Dynamic Languages
Author(s) :
Renggli, Lukas [Auteur]
Software Composition Group [Bern] [SCG]
Ducasse, Stephane [Auteur]
Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Gîrba, Tudor [Auteur]
Software Composition Group [Bern] [SCG]
Nierstrasz, Oscar [Auteur]
Software Composition Group [Bern] [SCG]
Software Composition Group [Bern] [SCG]
Ducasse, Stephane [Auteur]

Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Gîrba, Tudor [Auteur]
Software Composition Group [Bern] [SCG]
Nierstrasz, Oscar [Auteur]
Software Composition Group [Bern] [SCG]
Conference title :
4th Workshop on Dynamic Languages and Applications (DYLA 2010)
City :
Malaga
Country :
Espagne
Start date of the conference :
2010
Publication date :
2010
English keyword(s) :
scg-pub moose lse-pub pharo pharo-pub kzLanguageDesign
HAL domain(s) :
Informatique [cs]/Langage de programmation [cs.PL]
English abstract : [en]
Grammars for programming languages are traditionally specified statically. They are hard to compose and reuse due to ambiguities that inevitably arise. PetitParser combines ideas from scannerless parsing, parser combinators, ...
Show more >Grammars for programming languages are traditionally specified statically. They are hard to compose and reuse due to ambiguities that inevitably arise. PetitParser combines ideas from scannerless parsing, parser combinators, parsing expression grammars and packrat parsers to model grammars and parsers as objects that can be reconfigured dynamically. Through examples and benchmarks we demonstrate that dynamic grammars are not only flexible but highly practical.Show less >
Show more >Grammars for programming languages are traditionally specified statically. They are hard to compose and reuse due to ambiguities that inevitably arise. PetitParser combines ideas from scannerless parsing, parser combinators, parsing expression grammars and packrat parsers to model grammars and parsers as objects that can be reconfigured dynamically. Through examples and benchmarks we demonstrate that dynamic grammars are not only flexible but highly practical.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-00746253/document
- Open access
- Access the document
- https://hal.inria.fr/hal-00746253/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Reng10cDynamicGrammars.pdf
- Open access
- Access the document