HackerPapers

arXiv:1702.03277cs.LO

Local Lexing

Steven Obua, Phil Scott, Jacques Fleuriot

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

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 specification instead of leaving it up to the implementation. We present a high-level algorithm for local lexing, which is an extension of Earley's algorithm. We have formally verified the correctness of our algorithm with respect to its local lexing semantics in Isabelle/HOL.

arXiv comments
Journal reference
DOI
Subjects
cs.LOLogic in Computer Science

On Hacker News

Linked by 1 identifiable commenter in 2 comments across 2 threads, from Jul 2017 to Oct 2017.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. Show HN: Arxiv Vanity – Read academic papers from Arxiv as responsive web pages 1 comment

    • Not really my use case as I read PDF papers on an iPad Pro 12.9 inch, which is just fine, but very neat work! I tried it on this one: https://www.arxiv-vanity.com/papers/1702.03277/ Some commands don't work (\textsl, \rotatebox, ...) and the thank you footnote is incorporated…

      auggieroseView on HNParent context

  2. Lessons learned building a toy compiler 1 comment

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.