Search Results for "glr"

This project has moved to https://github.com/jplevyak/dparser The master on github is the stable. Please pull that for the very latest code. DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

NLT is free, open-source C# lexer and GLR parser suite -- which translates to ability to parse ambiguous grammars. Grammar can be defined directly in code or (preferably) in separate file (lex/yacc-like) for included generator. If you understand/guess the meaning of grammar in C#: // scanning lexer.AddStringRule(")", match => SymbolEnum.RPAREN); // parsing prod_builder.AddProduction(SymbolEnum.exp, SymbolEnum.LPAREN, SymbolEnum.exp, SymbolEnum.RPAREN, (_1, e, _3) => (AstNode)e); or grammar in NLT format: // scanning /[A-Za-z_][A-Za-z_0-9]*/ -> IDENTIFIER, IdentifierSymbol.Create($text); // parsing program -> list:namespace_list { new Program(currCoords(), (Namespaces)list) }; you should be able to use it :-). ...

loon is a GLR parser generator that takes EBNF grammars as specifications. Tokens are specified in the grammar file, and it generates a parse tree instead of executing actions. A single grammar can output a parser in any supported language.

A CUDA parallel parser for nondeterministic grammars based on a Bison-generated GLR Parser. Parsing has been used to syntactically analyze programming language. Usually, parsing programming languages is deterministic, i.e., there exists exactly one valid way to syntactically interpret the input. In this project, non-deterministic parsing is used as means to predicting RNA secondary structures. In non-deterministic parsing, more than one syntactic interpretation is valid.