Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
Try Google Cloud Risk-Free With $300 in Credit
No hidden charges. No surprise bills. Cancel anytime.
Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.
A Java library for parsing files and building Abstract Syntax Tree based on context free (CF) grammar.
Easy to use and provides fast prototyping. With grammar provided the library provides the AST of input. Command line interface is provided.
lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.
A free compiler for the algo language used to describe and implement algorithms in EPITA, a French software engineering school. See (FR) http://nathalie.bouquet.free.fr/epita/algo/langage/structure.php for a detailed grammar description.
Complete LALR(1) parser generator and engine in PHP.
Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?
The Language Machine is a toolkit for language and grammar: a library, main program, and self-hosted rule compilers with one frontend. The system is easy to use. It directly implements unrestricted rule-based grammars with actions and external interfaces.
Covra is a project to help design compilers. C3 is a tool specialized on the easy design and construction of ASTs, it is independent of the compiler compilers or parser generator that is used. It generates Java and C# code. Require JRE 1.6.0.
YAXX is an XML extension to YACC, a well-known public-domain compiler-compiler. This extension allows a program of a YACC grammar to be automatically converted into an XML document.
BNF processing tool checks correctness of BNF grammar, generates cross-referenced HTML documentation, generates tests for language recognizers (parsers).
A program for syntactically correct sentence generation. Guided by a Bison grammar file as input, it provides random or coverage testing sentences. The program can be used for compiler or parser testing or didactical purposes.
Visai Neri is an attempt to syntactically parse Natural Languages in general and Tamil in particular. To this end, we have developed an application using JavaCC to parse Venpa poetry after writing the grammar in BNF. Vision: complete Tamil grammar in
RelaxNGCC is a tool for generating Java source code from a given RELAX NG grammar.
By embedding code fragments in the grammar like yacc or JavaCC, you can take appropriate actions while parsing valid XML documents against the grammar.
Chaperon is a LALR(1) parser, which parse structured text documents and
generate XML documents as output. It includes a parser generator like yacc
and a regex scaner like lex. As input use Chaperon a grammar written in XML.
OpenZz is a dynamic parser which allows its grammar to be extended by commands written in its own Zz language. Due to the interpreted and dynamic nature of the parser OpenZz can be used to develop both fast language prototypes and full compilers.
C-smile OOL is a scripting language with C++-like grammar. It has compiler, VM running bytecodes and C++ extendible runtime. Intended to run in standlone and embedded mode.
The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.
This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net
Zonnon Compiler for java is an implementation of the grammar of zonnon for java.
There are different versions developed with javacc, sablecc, gold parser ....
GUI and Report tools too