| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 8 of 8
reviews
|
|
|
 |
|
|
|
|
Languages, levels, libraries, and longevity
Mashey J. Queue 2(9): 32-38, 2004. Type: Article
Mashey speculates on the reasons for the success of some programming languages, and the failure of others. After some initial speculation about the role of “programmer archaeologists” in the distant future, he descr...
|
Jun 24 2005 |
|
|
|
|
|
|
Completeness of combinations of conditional constructor systems
Middeldorp A. Journal of Symbolic Computation 17(1): 3-21, 1994. Type: Article
Both completeness and semi-completeness are decomposable properties of constructor systems (also known as term rewriting systems). The principal result in this paper is that these properties are also decomposable in conditional constru...
|
Sep 1 1995 |
|
|
|
|
|
|
RE2C: a more versatile scanner generator
Bumbulis P., Cowan D. ACM Letters on Programming Languages and Systems 2(1-4): 70-84, 1993. Type: Article
RE2C is a tool for generating scanners from regular expressions. The authors argue that the reason developers tend to hand-code scanners is inadequate performance by machine-generated scanners. RE2C is a good solution to this problem b...
|
May 1 1995 |
|
|
|
|
|
|
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 |
|
|
|
|
|
|
The complexity of computing the number of strings of given length in context-free languages
Bertoni A., Goldwurm M., Sabadini N. Theoretical Computer Science 86(2): 325-342, 1991. Type: Article
This highly mathematical treatise discusses computing the number of strings of length n in a language L generated by a context-free grammar. Specifically, the paper covers the complexity of the counting function associated with ...
|
Aug 1 1992 |
|
|
|
|
|
|
Equational completion in order-sorted algebras
Gnaedig I., Kirchner H. Theoretical Computer Science 72(2-3): 169-202, 1990. Type: Article
Completion methods for term rewriting systems are ways of constructing a terminating and confluent rewrite system from a set of axioms. The authors have taken on the task of developing a completion procedure for equational order-sorted...
|
Jul 1 1991 |
|
|
|
|
|
|
The complexity of graph languages generated by hyperedge replacement
Lautemann C. Acta Informatica 27(5): 399-421, 1990. Type: Article
Lautemann has taken on the task of analyzing the complexity of a subclass of graph languages, namely those generated by hyperedge replacement grammars. The resulting paper is a highly mathematical study of parsing of graph languages.
|
May 1 1991 |
|
|
|
|
|
|
Pascal for engineers and scientists with Turbo Pascal
Catlin A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1990. Type: Book (9789780136525615)
Catlin uses the most popular PC-based Pascal compiler, Turbo Pascal, to teach Pascal to science and engineering students (not computer science students). The book certainly emphasizes programming in Turbo Pascal and adequately addresse...
|
Feb 1 1991 |
|
|
|
|
|
| |
|
|
| |
|
|
