Generation of Compiler Symbol Processing Mechanisms from Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher order attribute grammars
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
The annotated C++ reference manual
The annotated C++ reference manual
Higher-order attribute grammars and editing environments
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
A survey of adaptable grammars
ACM SIGPLAN Notices
ACM SIGPLAN Notices
VisiCola, a model and a language for visibility control in programming languages
ACM SIGPLAN Notices
Generation and recognition of formal languages by modifiable grammars
ACM SIGPLAN Notices
Some remarks on the syntax of symbolic programming languages
Communications of the ACM
On the modification of the formal grammar at parse time
ACM SIGPLAN Notices
Attribute-influenced LR parsing
Semantics-Directed Compiler Generation, Proceedings of a Workshop
Modeling and implementation of visibility in programming languages
Modeling and implementation of visibility in programming languages
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Efficient formalism-only parsing of XML/HTML using the §-calculus
ACM SIGPLAN Notices
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Adaptable parsing expression grammars
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
| Hi-index | 0.00 |
This article presents a new tool for defining syntax and semantics of formal systems, called USSA (Universal Syntax and Semantics Analyzer). USSA is based on modifiable grammars introduced in [1, 2]. While parsing or generating the source text, USSA applies context-free rules from the current set of rules and modifies this set on the fly. The USSA concepts are illustrated by a rich variety of syntax and semantic constructions from programming languages.