Expand description
Recursive-descent parser for PDDL domain and problem files.
Consumes a token stream from the crate::lexer and produces the AST defined in
crate::ast. The parser handles all PDDL features encountered in IPC benchmarks
(1998–2014), including:
- Typing and type hierarchies (
:types,either) - Durative actions with temporal conditions/effects
- Numeric fluents, action costs, and metrics
- ADL quantifiers (
forall,exists) and conditional effects (when) - PDDL3 trajectory constraints and preferences
- Legacy PDDL 1.2
:varsin actions
§Entry points
| Function | Input | Output |
|---|---|---|
parse_domain_str | raw PDDL string | Domain |
parse_problem_str | raw PDDL string | Problem |
parse_domain | pre-tokenized &[Token] | Domain |
parse_problem | pre-tokenized &[Token] | Problem |
Functions§
- parse_
domain - Parse a pre-tokenized PDDL domain.
- parse_
domain_ str - Tokenize and parse a PDDL domain from a raw source string.
- parse_
problem - Parse a pre-tokenized PDDL problem.
- parse_
problem_ str - Tokenize and parse a PDDL problem from a raw source string.