Corrections to the paper: Scannerless NSLR(1) Parsing of Programming Languages
ACM SIGPLAN Notices
Scannerless NSLR(1) parsing of programming languages
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Incremental analysis of real programming languages
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Efficient and flexible incremental parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Disambiguation Filters for Scannerless Generalized LR Parsers
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Efficient self-versioning documents
COMPCON '97 Proceedings of the 42nd IEEE International Computer Conference
Practical Algorithms for Incremental Software Development Environments
Practical Algorithms for Incremental Software Development Environments
Harmonia: A Flexible Framework for Constructing Interactive
Harmonia: A Flexible Framework for Constructing Interactive
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Designing Syntax Embeddings and Assimilations for Language Libraries
Models in Software Engineering
Hi-index | 0.00 |
Automatically generated lexers and parsers for programming languages have a long history. Although they are well-suited for many languages, many widely-used generators, among them Flex and Bison, fail to handle input stream ambiguities that arise in embedded languages, in legacy languages, and in programming by voice. We have developed Blender, a combined lexer and parser generator that enables designers to describe many classes of embedded languages and to handle ambiguities in spoken input and in legacy languages. We have enhanced the incremental lexing and parsing algorithms in our Harmonia framework to analyze lexical, syntactic and semantic ambiguities. The combination of better language description and enhanced analysis provides a powerful platform on which to build the next generation of language analysis tools.