### Abstract

This formalisation accompanies the paper Local Lexing which introduces a novel parsing concept of the same name. The paper also gives a high-level algorithm for local lexing as an extension of Earley's algorithm. This formalisation proves the algorithm to be correct with respect to its local lexing semantics. As a special case, this formalisation thus also contains a proof of the correctness of Earley's algorithm. The paper contains a short outline of how this formalisation is organised.

### License

BSD License

### Topics

- Computer science/Automata and formal languages

### Session LocalLexing

- CFG
- LocalLexing
- LLEarleyParsing
- Limit
- LocalLexingLemmas
- InductRules
- ListTools
- Derivations
- Validity
- TheoremD2
- TheoremD4
- TheoremD5
- TheoremD6
- TheoremD7
- TheoremD8
- TheoremD9
- Ladder
- TheoremD10
- TheoremD11
- TheoremD12
- TheoremD13
- TheoremD14
- PathLemmas
- MainTheorems

## Cite

×

LocalLexing-AFP

    @article{LocalLexing-AFP,
      author  = {Steven Obua},
      title   = {Local Lexing},
      journal = {Archive of Formal Proofs},
      month   = {April},
      year    = {2017},
      note    = {\url{https://isa-afp.org/entries/LocalLexing.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Apr 28, 2017 : Isabelle2016-1