| Projects on Google Code | Results 1 - 10 of 11 |
The computer program yacc is a parser generator developed by Stephen C. Johnson at AT&T for the Unix operating system.
The name is an acronym for "Yet Another Compiler Compiler." It generates a parser (the part of a compiler that tries to make syntactic sense of the source code) based on an analyt...
This is not yet another parser.
Tinyap takes some text and an a grammar describing AST as inputs, and outputs another AST that describes the text contents, according to the provided grammar.
Basically, tinyap is a recursive descent parser with backup. Thus, it's able to recognize any LL(k) langu...
Grammatical evolution (GE) is an evolutionary algorithm which uses formal grammars, written in BNF, to define the search space. PonyGE is a small (one source file!) but functional implementation of GE in Python. It's intended as an advertisement and a starting-point for those new to GE, a reference ...
Name of our project is the Grammar Test
Rotfl / LolCodeISLol (Lol Code Interpreter Sucks, LOL!) is a lame interpreter written in C#. Based on EBNF rules and actually very error tolerant.
Using SLK generated parser in backend.
YaYAGA is a context-free grammar analyser.
It is not easy to say exactly what this project is. It is a big collection of almost everything that I was working on. You may find out whatever useful for you in the source code. You're also welcomed to contribute on this project. For details, please read the source.
The RailRoad Parser is a cross-platform, multi-language framework which can be used to create parsers for grammars. The two R's of the RailRoad Parser are *Runtime* and *Rule-Driven*. The framework is *rule-driven* in that the grammar which it parses is specified by a set of rules. These rules ar...
runtime,
rule,
rule-driven,
parser,
railroad,
grammar,
bnf,
backus-naur,
compiler,
interpreter,
language,
parse,
parsetree
Welcome to [http://yard-parser.sourceforge.net/ 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 resul...
*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.