Corpus ID: 6837834

Local Lexing

@article{Obua2017LocalL,
  title={Local Lexing},
  author={Steven Obua},
  journal={Arch. Formal Proofs},
  year={2017},
  volume={2017}
}
  • Steven Obua
  • Published 10 February 2017
  • Computer Science
  • Arch. Formal Proofs
We introduce a novel parsing concept called local lexing. It integrates the classically separated stages of lexing and parsing by allowing lexing to be dependent upon the parsing progress and by providing a simple mechanism for constraining lexical ambiguity. This makes it possible for language design to be composable not only at the level of context-free grammars, but also at the lexical level. It also makes it possible to include lightweight error-handling directly as part of the language… Expand
2 Citations
Parameterized Local Lexing
TLDR
The concept of parameterized local lexing is introduced and it is shown how this can be applied to lexing of types such as types for knowledge representation, representation of language models, and so on. Expand
ProofScript: Proof Scripting for the Masses
TLDR
ProofScript’s most important aspect of being an integrated language both for interactive proof and for proof scripting is discussed, which is its fit within a collaborative theorem proving environment. Expand

References

SHOWING 1-10 OF 11 REFERENCES
Parsing expression grammars: a recognition-based syntactic foundation
  • B. Ford
  • Computer Science
  • POPL '04
  • 2004
TLDR
PEGs address frequently felt expressiveness limitations of CFGs and REs, simplifying syntax definitions and making it unnecessary to separate their lexical and hierarchical components, and are here proven equivalent in effective recognition power. Expand
Semantics and algorithms for data-dependent grammars
TLDR
The design and theory of a new parsing engine, YAKKER, capable of satisfying the many needs of modern programmers and modern data processing applications is presented and its use on examples ranging from difficult programming language grammars to web server logs to binary data specification is illustrated. Expand
Formal development of correct algorithms: An example based on earley's recogniser
This paper contains the formal development of a correct algorithm from an implicit definition of the task to be performed. Each step of the development can be accompanied by a proof of itsExpand
Parsing Expression Grammars: A Recognition
  • Based Syntactic Foundation,
  • 2004
Schrödinger's token, Software Practice and Experience
  • Schrödinger's token, Software Practice and Experience
  • 2001
Scannerless Generalized-LR Parsing, Report P9707
  • 1997
Isabelle Theories for Local Lexing
  • Isabelle Theories for Local Lexing
Local Lexing Prototype Implementation (v1.0.1), doi: 10.5281/zenodo
  • Local Lexing Prototype Implementation (v1.0.1), doi: 10.5281/zenodo
Marpa and the Ruby Slippers, http:// blogs.perl.org/users/jeffrey_kegler/2011/ 11/marpa-and-the-ruby-slippers.html
  • Marpa and the Ruby Slippers, http:// blogs.perl.org/users/jeffrey_kegler/2011/ 11/marpa-and-the-ruby-slippers.html
The Marpa parser, http:// jeffreykegler.github.io/Marpa-web-site
  • The Marpa parser, http:// jeffreykegler.github.io/Marpa-web-site
...
1
2
...