Ebnf Studio

  •        0

Simple editor for managing and editing ebnf grammar files with included tools for visualizing, formatting, error chechking and etc




Related Projects

ANTLR - ANother Tool for Language Recognition

ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day.


C3PO is a software synthesis tool that provides a solution for building maintainable, reliable and robust software infrastructures and/or compiler frontends from a set of attributed grammar rules in EBNF notation.

Yet Another Compiler Compiler Language

YACCL is a simple Java recursive descent parser, in the tradition of other RDP technologies such as ANTLR and JavaCC. It differs from these in a number of ways: it is smaller and simpler (though not necessarily faster).

Lexical Analyzer and Parser Generator

Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.


DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.

Grammar Browser

Provides a GUI interface to grammatical structure and relations (as parsed by the Stanford Parser) of any text. Contains grammatical relation editor to modify, import, export grammatical relation definitions (tregex patterns and features).

Apaga - Another Parser Generator

apaga is a general-purpose parser generator that provides a framework for converting a grammar description for an LALR(1) context-free grammar into a program, that can be used in a variety of target languages, to parse that grammar.

Tinyap - Abstract and adaptative recursive-descent parser.

tinyap is in the process of migrating to github. The new version to come soon will bring many changes, including GLR algorithm instead of recursive descent, a relaxation of the constraint on pluggable rules (induced by the change in algorithm), and support for wordlists in a new type of token dubbed "bag of words".Below is the original text relative to versions 1.x:This is not yet another parser. Tinyap takes some text and an a grammar describing AST as inputs, and outputs another AST that descr

Yardparser - YARD Parsing Framework for C++

Welcome to Yet Another Recursive Descent (YARD) parsing framework for C++. YARD is inspired by Boost.Spirit. YARD allows the specification of parsing expression grammars (PEG) using types and templates directly, instead of through operator overloading. The result is a very compact and efficient parser generating library. YARD parsers automatically perform tokenization and construction of abstract syntax trees.

Alexander grammar engine

Alexander is a grammar engine capable of deciding a superset of the context free languages. Given a formal grammar and a string, Alexander decides whether the string matches the grammar.