Opening book details…
Can I read Verifiable Composition of Deterministic Grammars on EtoBox?
Verifiable Composition of Deterministic Grammars by August C. Schwerdfeger; Eric R. Van Wyk is a Computer Science article available to read on EtoBox.
What is Verifiable Composition of Deterministic Grammars about?
There is an increasing interest in extensible languages, (domain-specific) language extensions, and mechanisms for their specification and implementation. One challenge is to develop tools that allow non-expert programmers to add an eclectic set of language extensions to a host language. We describe mechanisms for composing and analyzing concrete syntax specifications of a host language and extensions to it. These specifications consist of context-free grammars with each terminal symbol mapped to a regular expression, from which a slightly-modified LR parser and context-aware scanner are generated. Traditionally, conflicts are detected when a parser is generated from the composed grammar, but this comes too late since it is the non-expert programmer directing the composition of independently developed extensions with the host language. The primary contribution of this paper is a modular analysis that is performed independently by each extension designer on her extension (composed alone with the host language). If each extension passes this modular analysis, then the language composed later by the programmer will compile with no conflicts or lexical ambiguities. Thus, extension writ
Who reads Verifiable Composition of Deterministic Grammars?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- August C. Schwerdfeger; Eric R. Van Wyk
- Publisher
- ACM
- Published
- 2009
- Language
- EN
- Field
- Computer Science (Physical Sciences)