Scannerless Boolean Parsing | Zendy

Adam Megacz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Scannerless Boolean Parsing

Author(s) -

Adam Megacz

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.10.007

Subject(s) - computer science , programming language , parsing , parsing expression grammar , rule based machine translation , intersection (aeronautics) , negation , lr parser , context free grammar , theoretical computer science , natural language processing , artificial intelligence , l attributed grammar , top down parsing , engineering , aerospace engineering

cannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation extensions beyond the usual context-free formalism are required.This paper explains how scannerless parsers for boolean grammars (context-free grammars extended with intersection and negation) can specify such languages unambiguously, and can also describe other interesting constructs such as indentation-based block structure.The sbp package implements this parsing technique and is publicly available as Java source code

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research