Tags : Browse Projects

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

GNU Bison

Compare

  Analyzed about 17 hours ago

34.4K lines of code

0 current contributors

over 2 years since last commit

114 users on Open Hub

Inactive
4.0
   
I Use This
Licenses: No declared licenses

ANTLR

Compare

  Analyzed about 20 hours ago

ANother Tool for Language Recognition (ANTLR) is the name of a parser generator that uses LL(k) parsing. ANTLR is the successor to the Purdue Compiler Construction Tool Set (PCCTS), first developed in 1989, and is under active development. Its maintainer is professor Terence Parr of the University of San Francisco.

203K lines of code

79 current contributors

8 days since last commit

59 users on Open Hub

High Activity
4.73333
   
I Use This

javacc

Compare

  Analyzed about 1 year ago

Java Compiler Compiler is the most popular parser generator for use with Java applications. A parser generator is a tool that reads a grammar specification and converts it to a Java program that can recognize matches to the grammar. In addition to the parser generator itself, JavaCC provides other ... [More] standard capabilities related to parser generation such as tree building (via a tool called JJTree included with JavaCC), actions, debugging, etc. [Less]

71.5K lines of code

2 current contributors

about 1 year since last commit

33 users on Open Hub

Activity Not Available
4.54545
   
I Use This

FileHelpers

Compare

  Analyzed about 18 hours ago

The FileHelpers are an easy to use .NET library written in C#. Is designed to read/write data from flat files with fixed length or delimited records (CSV)

65.4K lines of code

8 current contributors

10 days since last commit

31 users on Open Hub

Moderate Activity
4.14286
   
I Use This
Licenses: BSD-3-Clause, LGPL

parsec

Compare

  Analyzed about 6 years ago

Parsec is designed from scratch as an industrial-strength parser library. It is simple, safe, well documented (on the package homepage), has extensive libraries and good error messages, and is also fast.

2.6K lines of code

0 current contributors

almost 10 years since last commit

24 users on Open Hub

Activity Not Available
4.83333
   
I Use This

Spirit Parser Library

Compare

  Analyzed about 23 hours 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]

188K lines of code

10 current contributors

about 1 month since last commit

17 users on Open Hub

Low Activity
4.55556
   
I Use This

beautifulsoup

Compare

  Analyzed over 1 year ago

Beautiful Soup parses XML and HTML as seen in the wild, and provides a variety of methods and Pythonic idioms for iterating and searching the parse tree. Beautiful Soup development is now done at https://www.launchpad.net/beautifulsoup. The discussion forum is still at http://groups.google.com/group/beautifulsoup/.

1.96K lines of code

0 current contributors

over 5 years since last commit

16 users on Open Hub

Activity Not Available
4.8
   
I Use This

re2c

Compare

  Analyzed about 14 hours ago

re2c is a tool for writing very fast and very flexible scanners. Unlike any other such tool, re2c focuses on generating high efficient code for regular expression matching. As a result this allows a much broader range of use than any traditional lexer offers. And Last but not least re2c generates ... [More] warning free code that is equal to hand-written code in terms of size, speed and quality. [Less]

1.05M lines of code

7 current contributors

10 days since last commit

10 users on Open Hub

Moderate Activity
4.75
   
I Use This

Ragel

Compare

  Analyzed about 3 years ago

Ragel compiles finite state machines from regular languages into executable C, C++, Objective-C, D, Java or Ruby code. Ragel state machines can not only recognize byte sequences as regular expression machines do, but can also execute code at arbitrary points in the recognition of a regular language. ... [More] Code embedding is done using inline operators that do not disrupt the regular language syntax. [Less]

22.6K lines of code

3 current contributors

about 3 years since last commit

8 users on Open Hub

Activity Not Available
4.83333
   
I Use This

happy

Compare

  Analyzed about 6 years ago

Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar. Happy is flexible: you can have several Happy parsers in the ... [More] same program, and several entry points to a single grammar. Happy can work in conjunction with a lexical analyser supplied by the user (either hand-written or generated by another program), or it can parse a stream of characters directly (but this isn't practical in most cases). [Less]

5.03K lines of code

0 current contributors

over 9 years since last commit

8 users on Open Hub

Activity Not Available
4.25
   
I Use This