Incremental analysis of real programming languages

@inproceedings{Wagner1997IncrementalAO,
  title={Incremental analysis of real programming languages},
  author={T. Wagner and S. Graham},
  booktitle={PLDI '97},
  year={1997}
}
  • T. Wagner, S. Graham
  • Published in PLDI '97 1997
  • Computer Science
  • A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. [...] Key Method Our algorithm combines Tomita's generalized LR parser with reuse of entire subtrees via state-matching. Disambiguation can occur statically, during or after parsing, or during semantic analysis (using existing incremental techniques); program errors that preclude disambiguation retsin multiple interpretations indefinitely. Our representation and analyses gain efficiency by…Expand Abstract
    Elkhound: A Fast, Practical GLR Parser Generator
    • 161
    • PDF
    Supporting source code difference analysis
    • 80
    • Highly Influenced
    • PDF
    The relationship between program dependence and mutation analysis
    • 57
    • PDF
    Schrödinger's token
    • 34
    • PDF
    Decorating tokens to facilitate recognition of ambiguous language constructs
    • 27
    • PDF
    Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation
    • 34
    • PDF
    Even faster generalized LR parsing
    • 43
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES
    Efficient parsing for natural language
    • 393
    • Highly Influential
    • PDF
    Efficient incremental parsing for context-free languages
    • 39
    • Highly Influential
    • PDF
    Parser Generation for Interactive Environments
    • 151
    • Highly Influential
    The Annotated C++
    • 1990
    Haskell report
    • 1992