Searched for: +
(1 - 12 of 12)
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
document
Konat, G. (author), Kats, L.C.L. (author), Wachsmuth, G. (author), Visser, E. (author)
Preprint of paper published in: SLE 2012 - 5th International Conference on Software Language Engineering, 26-28 September 2012, Lecture Notes in Computer Science 7745; doi:10.1007/978-3-642-36089-3_18 In textual software languages, names are used to reference elements like variables, methods, classes, etc. Name resolution analyses these names in...
lecture notes 2012
document
Wachsmuth, G.H. (author), Konat, G.D.P. (author), Vergu, V.A. (author), Groenewegen, D.M. (author), Visser, E. (author)
This paper is a pre-print of: Guido H. Wachsmuth, Gabriel D.P. Konat, Vlad A. Vergu, Danny M. Groenewegen, Eelco Visser. A Language Independent Task Engine for Incremental Name and Type Analysis. In: Martin Erwig, Richard F. Paige, Eric Van Wyk, editors, Software Language Engineering, Sixth International Conference, SLE 2013, Indianapolis, USA,...
lecture notes 2013
document
Van Rest, O. (author), Wachsmuth, G.H. (author), Steel, J. (author), Süss, J.G. (author), Visser, E. (author)
This paper is a pre-print of: Oskar van Rest, Guido Wachsmuth, Jim Steel, Jörn Guy Süß, Eelco Visser. Robust Real-Time Synchronization between Textual and Graphical Editors. In Keith Duddy, Gerti Kappel, editors, Theory and Practice of Model Transformations, Sixth International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013....
lecture notes 2013
document
Visser, Eelco (author), Wachsmuth, G.H. (author), Tolmach, Andrew (author), Neron, P.J.M. (author), Vergu, V.A. (author), Passalaqua Martins, A. (author), Konat, G.D.P. (author)
The realization of a language design requires multiple artifacts that redundantly encode the same information. This entails significant effort for language implementors, and often results in late detection of errors in language definitions. In this paper we present a proof-of-concept language designer's workbench that supports generation of IDEs...
conference paper 2014
document
Neron, P.J.M. (author), Tolmach, A.P. (author), Visser, E. (author), Wachsmuth, G. (author)
We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax...
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), 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
van Antwerpen, H. (author), Neron, P.J.M. (author), Tolmach, Andrew (author), Visser, Eelco (author), Wachsmuth, G.H. (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...
conference paper 2016
document
de Souza Amorim, L.E. (author), Erdweg, S.T. (author), Wachsmuth, G.H. (author), Visser, Eelco (author)
Principled syntactic code completion enables developers to change source code by inserting code templates, thus increasing developer efficiency and supporting language exploration. However, existing code completion systems are ad-hoc and neither complete nor sound. They are not complete and only provide few code templates for selected...
conference paper 2016
document
Smits, J. (author), Wachsmuth, G.H. (author), Visser, Eelco (author)
Data-flow analysis is the static analysis of programs to estimate their approximate run-time behavior or approximate intermediate run-time values. It is an integral part of modern language specifications and compilers. In the specification of static semantics of programming languages, the concept of data-flow allows the description of well...
journal article 2020
Searched for: +
(1 - 12 of 12)