Difference between revisions of "Publications/david.05.sud"
From LRDE
| (5 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
| − | | published = |
+ | | published = false |
| date = 2005-05-01 |
| date = 2005-05-01 |
||
| authors = Valentin David, Akim Demaille, Renaud Durlin, Olivier Gournet |
| authors = Valentin David, Akim Demaille, Renaud Durlin, Olivier Gournet |
||
| Line 6: | Line 6: | ||
| note = Communication to Stratego Users Day 2005 |
| note = Communication to Stratego Users Day 2005 |
||
| address = Utrecht University, Netherland |
| address = Utrecht University, Netherland |
||
| − | | |
+ | | lrdeprojects = Transformers |
| − | | 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 |
| lrdepaper = http://www.lrde.epita.fr/dload/200505-SUD/disamb/article-200505-SUD-disamb.pdf |
||
| Line 21: | Line 20: | ||
address = <nowiki>{</nowiki>Utrecht <nowiki>{</nowiki>U<nowiki>}</nowiki>niversity, <nowiki>{</nowiki>N<nowiki>}</nowiki>etherland<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Utrecht <nowiki>{</nowiki>U<nowiki>}</nowiki>niversity, <nowiki>{</nowiki>N<nowiki>}</nowiki>etherland<nowiki>}</nowiki>, |
||
month = may, |
month = may, |
||
| − | project = <nowiki>{</nowiki>Transformers<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>We propose a novel approach to semantics driven |
abstract = <nowiki>{</nowiki>We propose a novel approach to semantics driven |
||
disambiguation based on Attribute Grammars (AGs). AGs share |
disambiguation based on Attribute Grammars (AGs). AGs share |
||
Latest revision as of 12:30, 12 November 2018
- Authors
- Valentin David, Akim Demaille, Renaud Durlin, Olivier Gournet
- Place
- Utrecht University, Netherland
- Type
- misc
- Projects
- Transformers
- 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.
Documents
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,
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.}
}