default search action
2. CC 1988: Berlin, GDR
- Dieter K. Hammer:
Compiler Compilers and High Speed Compilation, 2nd CCHSC Workshop, Berlin GDR, October 10-14, 1988, Proceedings. Lecture Notes in Computer Science 371, Springer 1989, ISBN 3-540-51364-7 - Werner Aßmann:
A Short Review of High Speed Compilation. 1-10 - Peter Fritzson:
Incremental Symbol Processing. 11-38 - Kai Koskimies:
Software Engineering Aspects in Language Implementation. 39-51 - Peter Lipps, Ulrich Möncke, Reinhard Wilhelm:
OPTRAN - A Language/System for the Specification of Program Transformations: System Overview and Experiences. 52-65 - Jaan Penjam:
Compiler Construction by Object-Oriented System Nut. 66-80 - Josef Grosch:
Generators for High-Speed Front-Ends. 81-92 - Tibor Gyimóthy, Tamás Horváth, Ferenc Kocsis, János Toczki:
Incremental Algorithms in Prof-LP. 93-102 - Uwe Kastens:
Abstract Interfaces for Compiler Generating Tools. 103-114 - Michael Albinus, Werner Aßmann:
The INDIA Lexic Generator. 115-127 - R. Nigel Horspool:
ILALR: An Incremental Generator of LALR(1) Parsers. 128-136 - Michael R. Levy:
Type Checking in the Large. 137-145 - Jorma Tarhio:
A Compiler Generator for Attributive Evaluation During LR Parsing. 146-159 - Henk Alblas:
Attributed Tree Transformations with Delayed and Smart Re-Evaluation. 160-174 - Görel Hedin:
Incremental Attribute Evaluation with Side-effects. 175-189 - Arnd Poetzsch-Heffter:
Optimizing Implementation of Aggregates in the Compiler Specification System MAGIC. 190-203 - Petr Kroha:
Code Generation for a RISC Machine. 204-214 - Beatrix Weisgerber, Reinhard Wilhelm:
Two Tree Pattern Matchers for Code Selection. 215-229 - Khalid Azim Mughal:
Generation of Incremental Indirect Threaded Code for Language-Based Programming Environments. 230-242
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.