Struct LexerAtnState 

pub struct LexerAtnState {
    pub state_number: usize,
    pub rule_index: Option<usize>,
    pub kind: AtnStateKind,
    pub end_state: Option<usize>,
    pub loop_back_state: Option<usize>,
    pub non_greedy: bool,
    pub precedence_rule_decision: bool,
    pub left_recursive_rule: bool,
    pub transitions: Vec<LexerTransition>,
}

A node in the ANTLR ATN graph.

Some ANTLR state subclasses carry references to paired states, such as a block-start state’s end state or a loop-end state’s loop-back state. This representation stores those links as state numbers so the graph remains easy to clone and serialize in tests.

Fields

state_number: usize

rule_index: Option<usize>

kind: AtnStateKind

end_state: Option<usize>

loop_back_state: Option<usize>

non_greedy: bool

precedence_rule_decision: bool

left_recursive_rule: bool

transitions: Vec<LexerTransition>

Implementations

impl LexerAtnState

pub const fn new(state_number: usize, kind: AtnStateKind) -> Self

Creates an ATN state with no rule index and no outgoing transitions.

pub const fn with_rule_index(self, rule_index: usize) -> Self

pub fn add_transition(&mut self, transition: LexerTransition)

Adds an outgoing transition in serialized order.

Transition order matters for alternatives and lexer priority, so the runtime preserves the order emitted by ANTLR.

pub fn is_rule_stop(&self) -> bool

Trait Implementations

impl Clone for LexerAtnState

fn clone(&self) -> LexerAtnState

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LexerAtnState

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

Formats the value using the given formatter.

impl Eq for LexerAtnState

impl PartialEq for LexerAtnState

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LexerAtnState