Tags : Browse Projects

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

Flex

Compare

  Analyzed over 1 year ago

Flex a tool for generating text scanners in C. The input file read by Flex specifies a set of rules (code to be executed when a pattern is found) which describe the scanner to be generated. The output of Flex is a C source file which can be compiled and linked with your sources, giving to your ... [More] executable the scanning capabilities tailored to your needs. Generally, Flex is used in combination with a parser generator, like Bison. [Less]

16.3K lines of code

0 current contributors

about 3 years since last commit

112 users on Open Hub

Activity Not Available
4.12
   
I Use This

ANTLR

Compare

  Analyzed 2 days 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

17 days since last commit

59 users on Open Hub

High Activity
4.73333
   
I Use This

Natural Language Toolkit (NLTK)

Compare

  Analyzed about 7 hours ago

NLTK — the Natural Language Toolkit — is a suite of open source Python modules, linguistic data and documentation for research and development in natural language processing, supporting dozens of NLP tasks, with distributions for Windows, Mac OSX and Linux.

213K lines of code

54 current contributors

7 days since last commit

45 users on Open Hub

High Activity
5.0
 
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

Modula-2 R10

Compare

  Analyzed about 11 hours ago

Modula-2 R10 language specification, grammar, syntax diagrams, standard library and reference compiler. The library is written in Modula-2. The reference compiler is written in C and it targets C and LLVM to allow bootstrapping on a wide range of architectures and operating systems.

24.4K lines of code

1 current contributors

about 1 year since last commit

18 users on Open Hub

Very Low Activity
4.85714
   
I Use This
Licenses: No declared licenses

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]

188K lines of code

14 current contributors

9 days since last commit

17 users on Open Hub

Low Activity
4.55556
   
I Use This

LanguageTool

Compare

  Analyzed 2 days ago

LanguageTool is an Open Source language checker for English, German, Polish, Dutch, and other languages. It's rule based, i.e. it will find errors for which a rule is defined in an XML configuration files. Rules for more complicated errors can be written in Java.

475K lines of code

42 current contributors

2 days since last commit

10 users on Open Hub

Very High Activity
4.66667
   
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

JFlex

Compare

  Analyzed 7 months ago

JFlex is a lexical analyzer generator (also known as scanner generator) for Java. It is a fork of JLex, and can read JLex files. JFlex is a flex-like lexer generator written in Java with emphasis on speed and full Unicode support. It has some not so usual features like negation in regexps and nested input streams.

132K lines of code

0 current contributors

about 3 years since last commit

6 users on Open Hub

Activity Not Available
4.0
   
I Use This