An interactive reverse engineering environment for large-scale C++ code
Proceedings of the 4th ACM symposium on Software visualization
A Framework for Reverse Engineering Large C++ Code Bases
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics and algorithms for data-dependent grammars
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program transformation using HATS 1.84
GTTSE'05 Proceedings of the 2005 international conference on Generative and Transformational Techniques in Software Engineering
The Semantics of Parsing with Semantic Actions
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An object-oriented parallel programming language for distributed-memory parallel computing platforms
Science of Computer Programming
| Hi-index | 0.00 |
Elkhound is an implementation of the Generalized LR (GLR) parsing algorithm [Tomita86, Rekers92] that allows the user to associate arbitrary C++ code with reduction actions, while retaining full control of sharing and disambiguation. Elkhound specifications are similar to those of YACC for LALR(1) grammar fragments, exposing the details of the GLR reduction process only where the grammar requires it. Further, the algorithm itself can switch on a token-by-token basis between GLR and simple LR, achieving very good performance for unambiguous portions of the input. The resulting system is familiar to even casual users of tools like YACC or Bison, but powerful enough to elegantly handle the dark corners of real-world languages.