This is a simple parser generator based on the Parsing Expression Grammar formalism.
rust-peg
relies on the unstable libsyntax
crate, and only works on Nightly builds of Rust.
However, generated parsers are compatible with 1.0 stable, so you can generate stable code by using the peg
command line tool described below.
Add to your Cargo.toml:
toml
[dependencies]
peg = "0.3.0"
Add to your crate root: ```rust
```
Use peg_file! modname("mygrammarfile.rustpeg");
to include the grammar from an external file. The macro expands into a module called modname
with functions corresponding to the #[pub]
rules in your grammar.
Or, use
rust
peg! modname(r#"
// grammar rules here
"#);`
to embed a short PEG grammar inline in your Rust source file. Example.
Run peg input_file.rustpeg
to compile a grammar and generate Rust code on stdout. This code works with stable Rust.
rust
use super::name;
The grammar may begin with a series of use
declarations, just like in Rust, which are included in
the generated module. Since the grammar is in its own module, you must use super::StructName;
to
access a structure from the parent module.
```rust
rule_name -> type = expression ```
If a rule is marked with #[pub]
, the generated module has a public function that begins parsing at that rule.
.
- match any single character"literal"
- match a literal string[a-z]
- match a single character from a set[^a-z]
- match a single character not in a setrule
- match a production defined elsewhere in the grammar and return its resultexpression*
- Match zero or more repetitions of expression
and return the results as a Vec
expression+
- Match one or more repetitions of expression
and return the results as a Vec
expression?
- Match one or zero repetitions of expression
. Returns an Option
&expression
- Match only if expression
matches at this position, without consuming any characters!expression
- Match only if expression
does not match at this position, without consuming any charactersexpression ** delim
- Match zero or more repetitions of expression
delimited with delim
and return the results as a Vec
expression ++ delim
- Match one or more repetitions of expression
delimited with delim
and return the results as a Vec
e1 / e2 / e3
- Try to match e1. If the match succeeds, return its result, otherwise try e2, and so on.e1 e2 e3
- Match expressions in sequencea:e1 b:e2 c:e3 { rust }
- Match e1, e2, e3 in sequence. If they match successfully, run the Rust code in the block and return its return value. The variable names before the colons in the preceding sequence are bound to the results of the corresponding expressions. The Rust code must contain matched curly braces, including those in strings and comments.a:e1 b:e2 c:e3 {? rust }
- Like above, but the Rust block returns a Result
instead of a value directly. On Ok(v)
, it matches successfully and returns v
. On Err(e)
, the match of the entire expression fails and it tries alternatives or reports a parse error with the &str
e
.Match actions can extract data from the match using these variables:
&str
slice. Examples:rust
name -> String
= [a-zA-Z0-9_]+ { match_str.to_string() }
rust
number -> int
= [0-9]+ { from_str::<u64>(match_str).unwrap() }
If you pass the peg/trace
feature to Cargo when building your project, a trace of the parsing will be output to stdout when running the binary. For example,
$ cargo run --features peg/trace
...
[PEG_TRACE] Matched rule type at 8:5
[PEG_TRACE] Attempting to match rule ident at 8:12
[PEG_TRACE] Attempting to match rule letter at 8:12
[PEG_TRACE] Failed to match rule letter at 8:12
...