Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference19 articles.
1. On the modification of the formal grammar at parse time
2. Generation and recognition of formal languages by modifiable grammars
3. On the translation of languages from left to right
4. [
4
] John E. Hopcroft Jeffrey D. Ullman. "Introduction to Automata Theory Languages and Computation " Addison-Wesley 1979. [4] John E. Hopcroft Jeffrey D. Ullman. "Introduction to Automata Theory Languages and Computation " Addison-Wesley 1979.
5. [
5
] Alfred V. Aho Ravi Sethi Jeffrey D. Ullman. "Compilers. Principles Techniques and Tools " Addison- Wesley 1988. [5] Alfred V. Aho Ravi Sethi Jeffrey D. Ullman. "Compilers. Principles Techniques and Tools " Addison- Wesley 1988.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献