Loading...
Please wait, while we are loading the content...
Similar Documents
Typed Syntax Macros
| Content Provider | CiteSeerX |
|---|---|
| Author | Swierstra, S. D. Baars, A. I. |
| Abstract | Using parser combinators we can dynamically generate parsers. We show how this property is used to define or to extend the syntax of a programming language from within a program itself, thus bringing the idea of "Syntax Macros" to life again. Part of the context-sensitive constraints that consequently have to be obeyed are enforced by dynamically constructing new parsers that only accept languages conforming to such constraints. One of the main goals of this paper is to show how this can be done in the context of a strongly typed language, without the need to explicitly encode and decode data. Because we use the parser combinators that analyse themselves, there is no speed penalty and the resulting parsers are error-repairing. 1. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Speed Penalty Context-sensitive Constraint Resulting Parser Typed Syntax Macro Parser Combinators Syntax Macro Programming Language New Parser Typed Language |
| Content Type | Text |
| Resource Type | Article |
