Search Results for "parser generator"

Automa is a regex-to-Julia compiler. By compiling regex to Julia code in the form of Expr objects, Automa provides facilities to create efficient and robust regex-based lexers, tokenizers and parsers using Julia's metaprogramming capabilities. You can view Automa as a regex engine that can insert arbitrary Julia code into its input-matching process, which will be executed when certain parts of the regex match an input.

PEG.js is a simple parser generator for JavaScript that produces fast parsers with excellent error reporting. You can use it to process complex data or computer languages and build transformers, interpreters, compilers and other tools easily. PEG.js is still very much work in progress. There are no compatibility guarantees until version 1.0. Based on parsing expression grammar formalism, more powerful than traditional LL(k) and LR(k) parsers.

...The base concepts of its architecture include: * Graphical deploy configuration builders * Powerful Groovy scripting language * Embedded database ( H2 , HSQLDB) to store data * Cross-platform design (write once, run anywhere) * Embedded GUI-configurable binary/ascii device protocol parser/generator * Deploy manager to deploy firmwares to remote controllers/servers via secure channel * Embedded web-sever * Dynamically linked plugins available from Nexus Repository * Remote monitoring tools * Modular Marid IDE to manage them all