From context-free grammars with priorities to character class grammars

[1]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[2]  Vincent Partington,et al.  Implementation of an Imperative Programming Language with Backtracking , 1997 .

[3]  Eelco Visser.  A Family of Syntax Deenition Formalisms , 1995 .

[4]  Alfred V. Aho,et al.  Deterministic parsing of ambiguous grammars , 1975, Commun. ACM.

[5]  Eelco Visser,et al.  A Case Study in Optimizing Parsing Schemata by Disambiguation Filters , 1997, IWPT.

[6]  Mikkel Thorup,et al.  Controlled grammatic ambiguity , 1994, TOPL.

[7]  Alex Sellink.  On the Conservativity of Leibniz Equality , 1998, Int. J. Found. Comput. Sci..

[8]  Wan Fokkink,et al.  An SOS Message: Conservative Extension in Higher Order Positive/Negative Conditional Term Rewriting , 1997 .

[9]  Pieter A. Olivier.  Debugging Distributed Applications Using a Coordination Architecture , 1997, COORDINATION.

[10]  P. Klint,et al.  Reverse engineering and system renovation—an annotated bibliography , 1997, SOEN.

[11]  Alex Sellink,et al.  A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes , 1995, Formal Aspects of Computing.

[12]  Jan A. Bergstra,et al.  Sequential data algebra primitives (revised version of P9602) , 1996 .

[13]  J. J. Brunekreef.  A transformation tool for pure Prolog programs: the algebraic specification , 1996 .

[14]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[15]  M.P.A. Sellink.  Transforming an ASF+SDF Specification into a ToolBus Application , 1996 .

[16]  T. B. Dinesh,et al.  Specifying Input and Output of Visual Languages , 1996 .

[17]  Murray Hill,et al.  Yacc: Yet Another Compiler-Compiler , 1978 .

[18]  Friedrich L. Bauer,et al.  Report on the algorithmic language ALGOL 60 , 1960, Commun. ACM.

[19]  J. Rekers,et al.  Parser Generation for Interactive Environments , 1992 .

[20]  Jan A. Bergstra,et al.  Sequential data algebra primitives , 1996 .

[21]  P. A. Olivier,et al.  Embedded system simulation: testdriving the ToolBus , 1996 .

[22]  Paul Klint,et al.  The syntax definition formalism SDF—reference manual— , 1989, SIGP.

[23]  Paul Klint,et al.  Re-engineering needs generic programming language technology , 1997, SIGP.

[24]  J. Brunekreef,et al.  TransLog, an interactive tool for transformation of logic programs , 1995 .

[25]  Leon Moonen,et al.  A generic architecture for data flow analysis to support reverse engineering , 1997 .

[26]  Eelco Visser.  Solving type equations in multi-level specifications (preliminary version) , 1996 .

[27]  Paul Klint,et al.  Core Technologies for System Renovation , 1996, SOFSEM.

[28]  Jan A. Bergstra,et al.  An Arithmetical Module for Rationals and Reals , 1997 .

[29]  Robert W. Floyd,et al.  Syntactic Analysis and Operator Precedence , 1963, JACM.

[30]  H. M. Sneed.  Dealing with the Dual Crisis - Year 2000 and Euro - What Reverse Engineering can do to Help , 1997 .

[31]  L.M.F. Moonen,et al.  Data Flow Analysis for Reverse Engineering , 1996 .

[32]  P. I. Manuel,et al.  ANSI Cobol III in SDF + an ASF Definition of a Y2K Tool , 1996 .

[33]  E. Schmidt,et al.  Lex—a lexical analyzer generator , 1990 .

[34]  Bob Diertens.  Simulation and Animation of Process Algebra Specifications , 1997 .

[35]  Chris Verhoef,et al.  Control flow normalization for COBOL/CICS legacy systems , 1998, Proceedings of the Second Euromicro Conference on Software Maintenance and Reengineering.

[36]  Eelco Visser,et al.  Scannerless Generalized-LR Parsing , 1997 .