A Constraint Language for Static Semantic Analysis Based on Scope Graphs

A Constraint Language for Static Semantic Analysis Based on Scope Graphs

van Antwerpen, H. (TU Delft Programming Languages)
Neron, P.J.M. (TU Delft Software Engineering)
Tolmach, Andrew (Portland State University)
Visser, Eelco (TU Delft Programming Languages)
Wachsmuth, G.H. (TU Delft Programming Languages)

2016-01

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 treat name and type resolution as separate building blocks, but our approach can handle language constructs -- such as record field access -- for which binding and typing are mutually dependent. We also refine and extend our previous scope graph theory to address practical concerns including ambiguity checking and support for a wider range of scope relationships. We describe the details of constraint generation for a model language that illustrates many of the interesting static analysis issues associated with modules and records.

Language Specification
Name Binding
Types
Domain Specific Languages
Meta-Theory

http://resolver.tudelft.nl/uuid:59d81879-3226-408e-9485-25d429562000

https://doi.org/10.1145/2847538.2847543

Association for Computing Machinery (ACM), New York, NY

978-1-4503-4097-7

PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2016-01-18 → 2016-01-19, St. Petersburg, FL., United States

Institutional Repository

conference paper

© 2016 H. van Antwerpen, P.J.M. Neron, Andrew Tolmach, Eelco Visser, G.H. Wachsmuth