Struct RuleShape 

pub struct RuleShape {
    pub display_id: DisplayId,
    pub expand1_inline: bool,
    pub to_include: Vec<WalkEntry>,
    pub append_nones: usize,
    pub produces_splice: bool,
}

Per-rule reduce-time instructions — one shared build_rule_shape is the tree-shaping contract both engines reuse (the POC’s duplicate copy is a named drop). Mirrors Lark’s maybe_create_child_filter

• _should_expand composition.

Fields

display_id: DisplayId

expand1_inline: bool

?rule with no alias: a 1-child result is returned unwrapped (Lark’s ExpandSingleChild).

to_include: Vec<WalkEntry>

The child-filter walk, one [WalkEntry] per kept position.

append_nones: usize

Placeholders appended after the last entry.

produces_splice: bool

The rule’s own origin is _-transparent: its reduce yields a splice, drained by the parent (LALR-private representation detail).

Trait Implementations

impl Clone for RuleShape

fn clone(&self) -> RuleShape

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RuleShape

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for RuleShape

impl PartialEq for RuleShape

fn eq(&self, other: &RuleShape) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for RuleShape