Searched for: department%3A%22Software%255C%252BTechnology%22
(1 - 5 of 5)
document
Van Antwerpen, H. (author), Néron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We...
report 2015
document
Van Antwerpen, H. (author), Néron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We...
report 2015
document
Van Antwerpen, H. (author), Neron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
We extend and combine two existing declarative formalisms, the scope graphs of Neron et al. and type constraint systems, to build a language-independent theory that can describe both name and type resolution for realistic languages with complex scope and typing rules. Unlike conventional static semantics presentations, our approach maintains a...
report 2015
document
Herrmannnsdoerfer, M. (author), Vermolen, S.D. (author), Wachsmuth, G. (author)
Modeling languages and thus their metamodels are subject to change. When a metamodel is evolved, existing models may no longer conform to it. Manual migration of these models in response to metamodel evolution is tedious and error-prone. To significantly automate model migration, operator-based approaches provide reusable coupled operators that...
lecture notes 2010
document
Kats, L.C.L. (author), Visser, E. (author), Wachsmuth, G. (author)
Syntax definitions are pervasive in modern software systems, and serve as the basis for language processing tools like parsers and compilers. Mainstream parser generators pose restrictions on syntax definitions that follow from their implementation algorithm. They hamper evolution, maintainability, and compositionality of syntax definitions. The...
report 2010
Searched for: department%3A%22Software%255C%252BTechnology%22
(1 - 5 of 5)