C/C++ Disambiguation Using Attribute Grammars

From LRDE

Revision as of 11:30, 12 November 2018 by Bot (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.}
}