Difference between revisions of "Publications/david.05.sud"
From LRDE
Line 9: | Line 9: | ||
| urllrde = 200505-SUD-disamb |
| urllrde = 200505-SUD-disamb |
||
| abstract = We propose a novel approach to semantics driven disambiguation based on Attribute Grammars (AGs). AGs share the same modularity model as its host grammar languagehere Syntax Definition Formalism (SDF), what makes them particularly attractive for working on unstable grammarsor grammar extensions. The framework we propose is effective, since a full ISO-C99 disambiguation chain already works, and the core of the hardest ambiguities of C++ is solved. This requires specific techniques, and some extensions to the stock AG model. |
| abstract = We propose a novel approach to semantics driven disambiguation based on Attribute Grammars (AGs). AGs share the same modularity model as its host grammar languagehere Syntax Definition Formalism (SDF), what makes them particularly attractive for working on unstable grammarsor grammar extensions. The framework we propose is effective, since a full ISO-C99 disambiguation chain already works, and the core of the hardest ambiguities of C++ is solved. This requires specific techniques, and some extensions to the stock AG model. |
||
− | | lrdepaper = http://www.lrde.epita.fr/dload/200505-SUD/disamb/article-200505-SUD-disamb.pdf |
||
| type = misc |
| type = misc |
||
| id = david.05.sud |
| id = david.05.sud |
Revision as of 01:01, 10 March 2015
- Authors
- Valentin David, Akim Demaille, Renaud Durlin, Olivier Gournet
- Place
- Utrecht University, Netherland
- Type
- misc
- Date
- 2005-05-01
Abstract
We propose a novel approach to semantics driven disambiguation based on Attribute Grammars (AGs). AGs share the same modularity model as its host grammar languagehere Syntax Definition Formalism (SDF), what makes them particularly attractive for working on unstable grammarsor grammar extensions. The framework we propose is effective, since a full ISO-C99 disambiguation chain already works, and the core of the hardest ambiguities of C++ is solved. This requires specific techniques, and some extensions to the stock AG model.
Bibtex (lrde.bib)
@Misc{ david.05.sud, author = {Valentin David and Akim Demaille and Renaud Durlin and Olivier Gournet}, title = {{C}/{C++} Disambiguation Using Attribute Grammars}, year = 2005, note = {Communication to Stratego Users Day 2005}, address = {Utrecht {U}niversity, {N}etherland}, month = may, project = {Transformers}, abstract = {We propose a novel approach to semantics driven disambiguation based on Attribute Grammars (AGs). AGs share the same modularity model as its host grammar language, here Syntax Definition Formalism (SDF), what makes them particularly attractive for working on unstable grammars, or grammar extensions. The framework we propose is effective, since a full ISO-C99 disambiguation chain already works, and the core of the hardest ambiguities of C++ is solved. This requires specific techniques, and some extensions to the stock AG model.} }