Scannerless Boolean Parser
- Scannerless Boolean Parser
Infobox_Software
name = SBP
developer = Adam Megacz
operating_system = Java Virtual Machine
genre = Parser generator
license = BSD license
website = [http://research.cs.berkeley.edu/project/sbp/]
The Scannerless Boolean Parser is a free software scannerless GLR parser generator for boolean grammars. It was implemented in the Java programming language and generates Java source code. SBP also integrates with Haskell via LambdaVM.
= External links =
* [http://research.cs.berkeley.edu/project/sbp/ SBP: the Scannerless Boolean Parser]
* [http://www.megacz.com/research/megacz,adam-sbp.a.scannerless.boolean.parser.pdf SBP LDTA'06 article]
* [http://www.megacz.com/software/wix/ WIX - wiki markup parser in SBP Haskell]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Scannerless parsing — (also called lexerless parsing ) refers to the use of a single formalism to express both the lexical and context free syntax used to parse a language.This parsing strategy is suitable when a clear lexer parser distinction is not required.… … Wikipedia
Comparison of parser generators — This is a list of notable lexer generators and parser generators for various language classes. Contents 1 Regular languages 2 Deterministic context free languages 3 Parsing expression grammars, deterministic boolean grammars … Wikipedia
GLR parser — In computer science, a GLR parser ( Generalized Left to right Rightmost derivation parser ) is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. First described in a 1986 paper by Masaru Tomita, it has also … Wikipedia
SBP — The initials SBP may represent, among other things:* Sekolah Berasrama Penuh, a school system for excellent students in Malaysia * in medicine, ** Spontaneous bacterial peritonitis ** Systolic blood pressure * the New York Stock Exchange ticker… … Wikipedia
Syntax Definition Formalism — The Syntax Definition Formalism (SDF for short) is a metasyntax used to define context free grammars: that is, a formal way to describe formal languages. It can express the entire range of context free grammars. Its current version is SDF2. A… … Wikipedia
