Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Compiler Construction: 13th International Conference, CC 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings > Elkhound: A Fast, Practical GLR Parser Generator
Compiler Construction: 13th International Conference, CC 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings |
Evelyn Duesterwald
Springer Berlin Heidelberg
Compiler Construction: 13th International Conference, CC 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings
Elkhound: A Fast, Practical GLR Parser Generator
Authors

Scott McPeak; George C. Necula

ARI Id

1664791837378_3236800

Access

Not Available Free

Pages

73-88

DOI

10.1007/978-3-540-24723-4_6

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-24723-4_6

Table of Contents of Book
Showing 1 to 20 of 22 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Developing a Foundation for Code Optimization
Mary Lou Soffa
1-4
Analyzing Memory Accesses in x86 Executables
Gogul Balakrishnan; Thomas Reps
5-23
The Limits of Alias Analysis for Scalar Optimizations
Rezaul A. Chowdhury; Peter Djeu; Brendon Cahoon; James H. Burrill; Kathryn S. McKinley
24-38
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
Venkatesh Prasad Ranganath; John Hatcliff
39-56
Data Dependence Profiling for Speculative Optimizations
Tong Chen; Jin Lin; Xiaoru Dai; Wei-Chung Hsu; Pen-Chung Yew
57-72
Elkhound: A Fast, Practical GLR Parser Generator
Scott McPeak; George C. Necula
73-88
Generalised Parsing: Some Costs
Adrian Johnstone; Elizabeth Scott; Giorgios Economopoulos
89-103
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
Erin Parker; Siddhartha Chatterjee
104-119
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization
Philippe Clauss; Irina Tchoupaeva
120-133
Periodic Polyhedra
Benoît Meister
134-149
Region-Based Partial Dead Code Elimination on Predicated Code
Qiong Cai; Lin Gao; Jingling Xue
150-166
Value-Based Partial Redundancy Elimination
Thomas VanDrunen; Antony L. Hosking
167-184
Increasing the Applicability of Scalar Replacement
Byoungro So; Mary Hall
185-201
Reducing the Cost of Object Boxing
Tim Owen; Des Watson
202-216
FFT Compiler Techniques
Stefan Kral; Franz Franchetti; Juergen Lorenz; Christoph W. Ueberhuber; Peter Wurzinger
217-231
Widening Integer Arithmetic
Kevin Redwine; Norman Ramsey
232-249
Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors
Emre Özer; Andy P. Nisbet; David Gregg
250-264
Using Multiple Memory Access Instructions for Reducing Code Size
Neil Johnson; Alan Mycroft
265-280
Integrating the Soot Compiler Infrastructure into an IDE
Jennifer Lhoták; Ondřej Lhoták; Laurie Hendren
281-297
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 22 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings