A simple, fast, and robust PDDL parser
pddlp has three goals:
- Robust - Is tested on commenly used PDDL domains and problems
- Fast - Optimised and benchmarked to be as fast as possible
- Simple - Avoids rarely used PDDL syntax in favor of easy of use
let input = "(define (problem prob)
(:objects o1)
(:init (p o1))
(:goal (not (p o3)))
)";
let problem = pddlp::problem::parse(&input)?;
assert_eq!(problem.name, Some("prob"));
assert_eq!(problem.domain, None);
assert_eq!(problem.objects, Some(vec![pddlp::problem::Object { name: "o1", type_name: None }]));
//...Benchmarked on a AMD Ryzen 5 5600X 6-Core Processor × 6 with Criterion
| Throughput | Time to Parse (see here) | |
|---|---|---|
| Domain | 436 MiB/s | 2 µs |
| Problem | 468 MiB/s | 523 ns |
| Plan | 507 MiB/s | 93 ns |