1984 | ||
---|---|---|
13 | EE | Richard Jüllig, Frank DeRemer: Regular right-part attribute grammars. SIGPLAN Symposium on Compiler Construction 1984: 171-178 |
1982 | ||
12 | EE | Frank DeRemer, Thomas J. Pennello: Efficient Computation of LALR(1) Look-Ahead Sets. ACM Trans. Program. Lang. Syst. 4(4): 615-649 (1982) |
1980 | ||
11 | Frank DeRemer, Richard Jüllig: Tree-affix dendrogrammars for languages and compilers. Semantics-Directed Compiler Generation 1980: 300-319 | |
1979 | ||
10 | EE | Thomas J. Pennello, Frank DeRemer: Efficient computation of LALR(1) look-ahead sets (with retrospective) Best of PLDI 1979: 14-27 |
9 | EE | Frank DeRemer, Thomas J. Pennello: Efficient computation of LALR(1) look-ahead sets. SIGPLAN Symposium on Compiler Construction 1979: 176-187 |
1978 | ||
8 | Thomas J. Pennello, Frank DeRemer: A Forward Move Algorithm for LR Error Recovery. POPL 1978: 241-254 | |
1976 | ||
7 | Frank DeRemer: Lexical Analysis. Compiler Construction 1976: 109-120 | |
6 | Frank DeRemer: Transformational Grammars. Compiler Construction 1976: 121-145 | |
5 | Frank DeRemer: Review of Formalisms and Notation. Compiler Construction 1976: 37-56 | |
4 | Frank DeRemer, Hans H. Kron: Programming-in-the-Large versus Programming-in-the-Small. Fachtagung über Programmiersprachen 1976: 80-89 | |
3 | Frank DeRemer, Hans H. Kron: Programming-in-the-Large Versus Programming-in-the-Small. IEEE Trans. Software Eng. 2(2): 80-86 (1976) | |
1974 | ||
2 | William M. McKeeman, Frank DeRemer: Feedback-free Modularization of Compilers. Fachtagung über Programmiersprachen 1974: 78-88 | |
1971 | ||
1 | Frank DeRemer: Simple LR(k) Grammars. Commun. ACM 14(7): 453-460 (1971) |
1 | Richard Jüllig | [11] [13] |
2 | Hans H. Kron | [3] [4] |
3 | William M. McKeeman | [2] |
4 | Thomas J. Pennello | [8] [9] [10] [12] |