Practical Dynamic Grammars for Dynamic Languages
Type de document :
Communication dans un congrès avec actes
Titre :
Practical Dynamic Grammars for Dynamic Languages
Auteur(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]
Titre de la manifestation scientifique :
4th Workshop on Dynamic Languages and Applications (DYLA 2010)
Ville :
Malaga
Pays :
Espagne
Date de début de la manifestation scientifique :
2010
Date de publication :
2010
Mot(s)-clé(s) en anglais :
scg-pub moose lse-pub pharo pharo-pub kzLanguageDesign
Discipline(s) HAL :
Informatique [cs]/Langage de programmation [cs.PL]
Résumé en anglais : [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, ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-00746253/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-00746253/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Reng10cDynamicGrammars.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- Reng10cDynamicGrammars.pdf
- Accès libre
- Accéder au document