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
Build Securely on AWS with Proven Frameworks
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
...Thread:mutex-condition queue and map,ACE style thread and Glib style thread pool, loop task.
Memory:memory pool.
COM:COM object invocation.
Language:compiler lexical and grammar analysis.
Network:epoll reactor.
Nyu is a PEG based parser generator in which an appropriate AST type and a parser which populates this AST can be created from a single grammar description.
Kaptain is a universal graphical front-end for command line programs. Grammar scripts describe the possible parameters for command lines and Kaptain brings up a user friendly dialog for that. Package contains front-ends for Enscript, Indent, Procmail
An other library for the common problem of parsing arbitrary text data.
A small, easy-to-use Java library
LR parser without lookahead limitation.
Semantic action defined in class not in grammar definition file.
Tk-UI is a Java Toolkit for declaratively building User Interfaces (UI). UI is described with an XML grammar (XUL, XHTML, etc.), logic is managed with a scripting language (JavaScript, etc.). UI is rendered with an actual GUI library (SWT, Swing, etc.).
Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.
Tsunami is an open-source high performance computing language. With it you can write streaming data-parallel algorithms that utilize GPGPUs for orders-of-magnitude speed-up with the ease of writing sequential algorithms.
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.
Parse software messages and transform them into actions. LazyBat has a command line utility which can transform input data, and also a parser generator for C/C++. LazyBat doesn't support recursive parsing, but rather focuses on common parsing jobs.
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.
Java library for constructing embedded parsers. A parser is constructed by Java objects. A fluent interface API helps to define the grammar in an EBNF-like style. No Java source code will be generated. ParCinJ is suitable domain specific languages (DSL).
Libparser is a C++ library for parsing. It can generate a parsing table at runtime (loading a BNF grammar file). It also includes a tool for creating the parsing table in a file or in C/C++ code. It currently can parse LL1 and SLR1 grammars.
Funky is a tiny, embeddable, functional programming language inspired from lisp. Its grammar is small and unambiguous, which makes it very easy to write a script in Funky, which you could embed in any program.
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.
The Lingual Quanta is an organization created by software engineers that are interested in Natural Language Processing technologies focused in libraries useful for projects such as grammar checkers, text markups etc.
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.
A sub-C cross compiler for EduMIPS64 simulator. EduXcomp is a java project built using the antlr tool, and a grammar written by Monty Zukowski hardly modified by Elena Carobene, Massimo Trubia, and Alessio Tognazzolo.
JScript is Java Interpreter that parse and execute pure java code and share the resource with current JVM. In addition, a java command line console is included. It's easy to create script program in Java grammar by it.
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.
Given YACC-like and LEX-like input files, yagg generates a C++ program that generates all strings of a user-specified length. yagg is easy to use, and provides a means of generating test inputs or validating a parser grammar by inspecting the strings.
This project was created to show a way to highlight keywords of any language in a simple way. The resource which has been used is ANLTR (www.antlr.org).
You are free to adapt it for your language, you just have to define the keywords in the grammar file.