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.

The tool can handle left recursion.

An integral feature of "Mouse" is the mechanism for specifying semantics (also in Java). This makes "Mouse" a convenient tool if one needs an ad-hoc language processor. Being written in Java, the processor is operating-system independent.

Included in the package is PEG Explorer, an interactive tool to investigate the effect of limited backtracking.
Sample grammars for Java & C are available from the Web Site.

Features

Project Samples

Project Activity

See All Activity >

Categories

Compilers

License

Apache License V2.0

Follow From PEG to a practical parser

From PEG to a practical parser Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of From PEG to a practical parser!

Additional Project Details

Intended Audience

Developers, Information Technology

User Interface

Command-line

Programming Language

Java

Related Categories

Java Compilers

Registered

2010-04-05