| |
Browse All Reviews > Software (D) > Programming Languages (D.3) > Formal Definitions And Theory (D.3.1) > Syntax (D.3.1...)
|
|
 |
|
|
| |
|
|
| |
1-7 of 7
Reviews about "Syntax (D.3.1...)":
|
Date Reviewed |
| |
FeatherTrait: A modest extension of featherweight Java
Liquori L., Spiwack A. ACM Transactions on Programming Languages and Systems 30(2): 1-32, 2008. Type: Article
A trait is an elementary unit of behavior for structuring object-oriented programs. A trait is essentially a set of methods intended to be composed with other traits in order to form a new trait. Moreover, a trait may be used by classe...
|
Sep 4 2008 |
| |
iRho: an imperative rewriting calculus
Liquori L., Serpette B. Principles and practice of declarative programming (Proceedings of the 6th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, Verona, Italy, Aug 24-26, 2004) 167-178, 2004. Type: Proceedings
Liquori and Serpette present a calculus called iRho. This calculus is a refinement of the Rho calculus introduced by Christea, Kirchner, and Liquori [1]. While Rho is a rewrite-based calculus, iRho is an “imperative rewriting...
|
Oct 11 2004 |
| |
Extending context-free grammars with permutation phrases
Cameron R. ACM Letters on Programming Languages and Systems 2(1-4): 85-94, 1993. Type: Article
In this pithy and interesting paper, the author proposes the permutation phase as a notational extension for Backus-Naur form (BNF) grammars. Like optionality ([…]) and iteration ({…}), this extension improve...
|
Dec 1 1994 |
| |
Defining context-dependent syntax without using contexts
Odersky M. ACM Transactions on Programming Languages and Systems 15(3): 535-562, 1993. Type: Article
Odersky presents a new method for specifying static semantics. Contextual constraints (such as type checking) are specified using formulas from the first-order predicate calculus, while reasoning about the set of nodes in the program&a...
|
Dec 1 1994 |
| |
User-friendly syntax: design and presentation
Henno J. International Journal of Man-Machine Studies 28(5): 551-572, 1988. Type: Article
This poorly written paper contains little material of significant interest. Commencing with yet another look at the inconsistencies of Ada (in this case declarative syntax), the author moves on to describe experiments using three mini-...
|
Jun 1 1989 |
| |
On the (non-) relationship between SLR(1) and NQLALR(1) grammars
Bermudez M., Schimpf K. ACM Transactions on Programming Languages and Systems 10(2): 338-342, 1988. Type: Article
Precise definitions of grammar classes have always been a vexing subject. Bermudez and Schimpf demonstrate that the Not-Quite-LALR(1) grammars, long thought to be a strict superset of the SLR(1) grammars, are in fact neither a superset...
|
Oct 1 1988 |
| |
Formal syntax methods for natural language
Johnson D., Bryant B. Information Processing Letters 19(3): 135-143, 1984. Type: Article
This paper describes on-going research into the applications of some techniques normally used to formally specify and analyze the context-sensitive syntax of programming languages to the specification and analysis of the syntax of a na...
|
Jun 1 1985 |
| |
|
|
| |
|
|
