Theoretical Computer Science 1998: Vol 199 Table of Contents

2 Pages·1998·0.2 MB·English

Theoretical Computer Science
Algorithms, automata, complexity and games
Volume 199, Numbers 1-2, 15 June 1998
AMILP ‘95
Guest Editors: A. Nijholt
G. Scollo
Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fir Mathematik
Contents
Editorial
A. Nijholt and G. Scollo
Contributions
W. Buszkowski
Algebraic structures in categorial grammar
T.M.V. Janssen
Algebraic translations, correctness and algebraic compiler construction 25
E. Visser
Polymorphic syntax definition 57
K. Sikkel
Parsing schemata and correctness of parsing algorithms 87
T. Rus
Algebraic processing of programming languages 105
F. Tendeau
Computing abstract decorations of parse forests using dynamic programming
and algebraic power series 145
E. Villemonte de la Clergerie and F. Barthélemy
Information flow in tabular interpretations for generalized push-down automata 167
T. Rus and J.S. Jones
PHRASE parsers from multi-axiom grammars 199
J.C. Ramatho, J.J. Almeida and P. Henriques
Algebraic specification of documents 231
Author index volume 199 249