Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Spirit Parser Library

Compare

  Analyzed 2 days 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 ... [More] written exclusively in C++. EBNF grammar specifications can mix freely with other C++ code and, thanks to the generative power of C++ templates, are immediately executable. [Less]

193K lines of code

13 current contributors

9 months since last commit

17 users on Open Hub

Very Low Activity
4.55556
   
I Use This

Irony — .NET Language Implementation Kit

Compare

  Analyzed 3 days 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 ... [More] in c# using operator overloading to express grammar constructs. Irony's scanner and parser modules use the grammar encoded as c# class to control the parsing process. See the expression grammar sample for an example of grammar definition in c# class, and using it in a working parser. [Less]

25.9K lines of code

4 current contributors

3 months since last commit

4 users on Open Hub

Low Activity
5.0
 
I Use This

PEGTL

Compare

  Analyzed 3 days 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).

23.2K lines of code

0 current contributors

about 2 months since last commit

2 users on Open Hub

Moderate Activity
0.0
 
I Use This

BNFC

Compare

  Analyzed 1 day ago

The BNF Converter is a compiler construction tool generating a compiler front-end from a Labelled BNF grammar. It is currently able to generate C, C++, C#, F#, Haskell, Java, and OCaml, as well as XML representations. Given a Labelled BNF grammar the tool produces: * an abstract syntax ... [More] implementation * a case skeleton for the abstract syntax in the same language * an Alex, JLex, or Flex lexer generator file * a Happy, CUP, or Bison parser generator file * a pretty-printer as a Haskell/Java/C++/C module * a Latex file containing a readable specification of the language [Less]

83.8K lines of code

5 current contributors

16 days since last commit

2 users on Open Hub

Very Low Activity
0.0
 
I Use This

C# Lex Yacc

Compare

  Analyzed 2 days ago

a C# embeddable lexer and parser generator (.Net core)

34.9K lines of code

6 current contributors

4 days since last commit

1 users on Open Hub

Moderate Activity
0.0
 
I Use This

uri_grammar

Compare

  Analyzed about 3 hours ago

uri_grammar provides a Spirit grammar for parsing URIs. The grammar is parameterized with user-supplied parse actions.

634 lines of code

0 current contributors

over 9 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

ParserLab

Compare

  Analyzed 3 days ago

Generate parsers with ease, using a graphical user interface, or console. Design your parsers graphically or by using standard regular expressions and BNF syntax similar to lex/yacc. Generated parsers can be in C or C++.

2.78K lines of code

0 current contributors

about 13 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This
Licenses: No declared licenses

Sweet Parser

Compare

  Analyzed about 17 hours 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 ... [More] executable that provides Lua scriptable code generation from the parser state machine. Parsers generated this way have no dependencies on anything other than the standard libary. [Less]

7.83K lines of code

0 current contributors

about 8 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

Eto.Parse

Compare

  Analyzed about 21 hours ago

Recursive descent LL(k) parser for .NET with Fluent API, BNF, EBNF and Gold Grammars

17.8K lines of code

0 current contributors

almost 2 years since last commit

1 users on Open Hub

Very Low Activity
5.0
 
I Use This

jcbnfp

Compare

  No analysis available

JCBNF parser library for Java

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: gpl3_or_l...