Tags : Browse Projects

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

Sweet Parser

Compare

  Analyzed 1 day 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

over 7 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

Ruby LinkParser

Compare

  Analyzed about 24 hours ago

A high-level interface to the CMU Link Grammar. This binding wraps the link-grammar shared library provided by the AbiWord project for their grammar-checker.

2.41K lines of code

1 current contributors

over 1 year since last commit

1 users on Open Hub

Very Low Activity
0.0
 
I Use This

uri_grammar

Compare

  Analyzed about 7 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

about 9 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

Lestes

Compare

  Analyzed about 7 hours ago

Project Lestes is an ongoing effort to make a C++ compiler with comprehensive C++ source code using the most advanced algorithms seen. Other goals include: easilly retargettable compiler, compiler that can be successfully used in teaching compiler construction, compiler that can compile multitude of languages.

263K lines of code

0 current contributors

over 15 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This

EBNFtool

Compare

  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. ... [More] EBNFtool is written in C. Work in progress. Requires C99 and KVSlib. [Less]

0 lines of code

0 current contributors

0 since last commit

1 users on Open Hub

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

GRAC

Compare

  No analysis available

GRAC is a GRAmmar Checker written in Python. GRAC is based on learning algorithms, it needs tagged text corpus and mistake-free corpus to learn grammar rules and then detects grammar errors on a sentence or text you give.

0 lines of code

0 current contributors

0 since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This
Mostly written in language not available
Licenses: No declared licenses

HUsyntactic

Compare

  Analyzed about 24 hours ago

A syntactic analyzer uses CYK, Earley.

2.48K lines of code

0 current contributors

over 5 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This
Licenses: No declared licenses

Raku PDF

Compare

  Analyzed about 21 hours ago

Perl6 Familiy of tools for PDF processing and construction. This project corresponds to the https://github.com/p6-pdf project on github.

18.8K lines of code

3 current contributors

14 days since last commit

1 users on Open Hub

Moderate Activity
0.0
 
I Use This
Licenses: No declared licenses

FieldWorks

Compare

  Analyzed 1 day ago

FieldWorks consists of software tools that help you manage linguistic and cultural data. FieldWorks supports tasks ranging from the initial entry of collected data through to the preparation of data for publication: -dictionary development -interlinearization of texts -cultural ... [More] records, which can be categorized using the Outline of Cultural Materials -bulk editing of many fields -morphological analysis -complex non-Roman scripts using Unicode and SIL-developed Graphite -multi-user editing capability over a local area network. [Less]

8.59M lines of code

6 current contributors

3 months since last commit

1 users on Open Hub

Low Activity
0.0
 
I Use This

aflex

Compare

  Analyzed about 6 hours ago

Aflex the Ada fast lexical analyser generator

14.7K lines of code

0 current contributors

2 months since last commit

1 users on Open Hub

Low Activity
5.0
 
I Use This
Licenses: No declared licenses