Select a tag to browse associated projects and drill deeper into the tag cloud.
Spirit Parser Library
Analyzed 2 months ago
Spirit is an object-oriented, recursive descent parser generator framework implemented using template meta-programming techniques. Expression templates allow Spirit to approximate the syntax of Extended Backus Normal Form (EBNF) completely in C++. The Spirit framework enables a target grammar to be
Licenses:
boost
Irony — .NET Language Implementation Kit
I
Analyzed 2 months ago
Irony is a development kit for implementing languages on .NET platform. Unlike most existing yacc/lex-style solutions Irony does not employ any scanner or parser code generation from grammar specifications written in a specialized meta-language. In Irony the target language grammar is coded directly
pyrser
P
Analyzed 2 months ago
Pyrser is a toolbox with : A PEG parser, AST rewriting helpers and Type System.
Pyrser is a python module that help you for all parsing job. You could use a EDSL (with here docs) for writing your BNF. But you could also use Python Class to describe your grammar.
Pyrser is available on Pypi
Licenses:
No declared licenses
PEGTL
P
Analyzed 2 months ago
The Parsing Expression Grammar Template Library (PEGTL) is a zero-dependency C++ header-only parser combinator library for creating parsers according to a Parsing Expression Grammar (PEG).
uri_grammar
Analyzed 2 months ago
uri_grammar provides a Spirit grammar for parsing URIs. The grammar is parameterized with user-supplied parse actions.
Eto.Parse
E
Analyzed 2 months ago
Recursive descent LL(k) parser for .NET with Fluent API, BNF, EBNF and Gold Grammars
Sweet Parser
Analyzed 2 months ago
Sweet Parser is a C++ parser library.
Given a BNF grammar the library generates an LALR(1) parser that recognizes the language described by that grammar. The parser can be generated at runtime without the need for an offline generation step. If generation is required there is a stand alone
Licenses:
zlib_libpng
EBNFtool
E
No analysis available
EBNFtool is a library and utility to parse EBNF grammars, then generate and output: 1) a symbol cross reference, 2) FIRST and FOLLOW sets, 3) a proof whether LL(1) conditions are satisfied. It is further planned to add a syntax diagram generator (aka railroad diagram generator) in the future.
Mostly written in language not available
Licenses:
bsd
Lark Parsing Library
L
Analyzed 2 months ago
A modern parsing library for Python, implementing Earley & LALR(1) and an easy interface
Licenses:
No declared licenses