Browsing projects by Tag(s)

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

Showing page 1 of 6

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.

4.73333
   
  0 reviews  |  57 users  |  41,900 lines of code  |  8 current contributors  |  Analyzed 4 days 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.

5.0
 
  0 reviews  |  41 users  |  214,316 lines of code  |  39 current contributors  |  Analyzed 1 day 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]

4.8
   
  1 review  |  31 users  |  32,727 lines of code  |  1 current contributor  |  Analyzed over 2 years 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]

4.6
   
  0 reviews  |  18 users  |  234,630 lines of code  |  0 current contributors  |  Analyzed 6 days 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]

4.83333
   
  0 reviews  |  8 users  |  40,889 lines of code  |  1 current contributor  |  Analyzed about 1 year 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 ... [More] in the 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]

4.25
   
  0 reviews  |  7 users  |  5,034 lines of code  |  0 current contributors  |  Analyzed almost 2 years 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.

4.0
   
  0 reviews  |  5 users  |  46,620 lines of code  |  2 current contributors  |  Analyzed 7 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]

5.0
 
  1 review  |  4 users  |  29,025 lines of code  |  1 current contributor  |  Analyzed 3 days ago
 
 

Treex (formerly TectoMT) is a highly modular NLP software system implemented in Perl programming language under Linux. It is primarily aimed at Machine Translation, making use of the ideas and technology created during the Prague Dependency Treebank project. At the same time, it is also hoped to ... [More] significantly facilitate and accelerate development of software solutions of many other NLP tasks, especially due to re-usability of the numerous integrated processing modules (called blocks), which are equipped with uniform object-oriented interfaces. [Less]

5.0
 
  0 reviews  |  3 users  |  270,836 lines of code  |  21 current contributors  |  Analyzed 13 days ago
 
 

Provides an ANTLR plugin (including grammar file editor with outline page and project nature with incremental builder) for the Eclipse platform

5.0
 
  0 reviews  |  3 users  |  113,132 lines of code  |  0 current contributors  |  Analyzed about 16 hours ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.