Search Results for "descent"

It is an LL(1) recursive descent parser generator written in VB.NET which can generate a scanner, parser, and parsetree file in either C# , Java or VB code. The original code and documentation can be found in the article 'A Tiny Parser Generator v1.2' on CodeProject. Requires dotNet2.0

Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent recursive procedures. ...

Common Text Transformation Library of C++ classes and functions to parse and modify STL strings. CTTL substring classes may be compared, inserted, replaced, and parsed with EBNF grammars. Compiled program implements recursive descent LL(INF) parser.

Verto is a compiler that uses a top-down recursive descent parser implemented in Java for educational purposes. It translates Verto language (a subset of the C language) into Caesar machine language. Verto is the Latin word for interpret.

JetPAG is a recursive-descent parser and lexical analyzer generator focused on high efficiency, usability and readability of generated code. JetPAG generates fast recognizers and aids developers with useful tools for simplifying input interpretation.

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).