Struct GraphParser 

pub struct GraphParser<'a> {
    pub tokens: &'a [Token],
    pub at: usize,
}

A self-contained recursive-descent parser for the nodes = {...} and branches = {...} bodies, operating directly on a token slice.

Fields

tokens: &'a [Token]

The full token stream being parsed.

at: usize

Current cursor position into tokens.

Implementations

impl<'a> GraphParser<'a>

pub fn node_graph(&mut self) -> Result<(NodeGraph, usize), SpecError>

{ name = { field* }; ... } — the whole nodes = {...} body.

Returns the parsed graph together with the token position just past its closing } — spec.rs’s Parser (a separate struct walking the same token slice, Task 3) needs that position to resume parsing the rest of the spec {...} body afterward, since it can’t see GraphParser’s internal cursor otherwise.

pub fn branches(&mut self) -> Result<(Branches, usize), SpecError>

{ node_name = { "label" -> target; ... }; ... } — the whole branches = {...} body. Returns (Branches, new_at), same handoff convention as Self::node_graph.