Enum LexerTransition 

pub enum LexerTransition {
    Epsilon {
        target: usize,
    },
    Atom {
        target: usize,
        label: i32,
    },
    Range {
        target: usize,
        start: i32,
        stop: i32,
    },
    Set {
        target: usize,
        set: IntervalSet,
    },
    NotSet {
        target: usize,
        set: IntervalSet,
    },
    Wildcard {
        target: usize,
    },
    Rule {
        target: usize,
        rule_index: usize,
        follow_state: usize,
        precedence: i32,
    },
    Predicate {
        target: usize,
        rule_index: usize,
        pred_index: usize,
        context_dependent: bool,
    },
    Action {
        target: usize,
        rule_index: usize,
        action_index: Option<usize>,
        context_dependent: bool,
    },
    Precedence {
        target: usize,
        precedence: i32,
    },
}

Edge between two ATN states.

Epsilon-like transitions do not consume input. Matching transitions compare the current input symbol against an atom, range, set, negated set, or wildcard.

Variants

Epsilon

Fields

target: usize

Atom

Fields

target: usize

label: i32

Range

Fields

target: usize

start: i32

stop: i32

Set

Fields

target: usize

set: IntervalSet

NotSet

Fields

target: usize

set: IntervalSet

Wildcard

Fields

target: usize

Rule

Fields

target: usize

rule_index: usize

follow_state: usize

precedence: i32

Predicate

Fields

target: usize

rule_index: usize

pred_index: usize

context_dependent: bool

Action

Fields

target: usize

rule_index: usize

action_index: Option<usize>

context_dependent: bool

Precedence

Fields

target: usize

precedence: i32

Implementations

impl LexerTransition

pub const fn target(&self) -> usize

Returns the target state number for this transition.

pub const fn is_epsilon(&self) -> bool

Returns whether traversing this transition consumes no input.

pub fn matches( &self, symbol: i32, min_vocabulary: i32, max_vocabulary: i32, ) -> bool

Tests whether this transition consumes symbol.

min_vocabulary and max_vocabulary define the accepted symbol range for wildcard and negated-set transitions.

Trait Implementations

impl Clone for LexerTransition

fn clone(&self) -> LexerTransition

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LexerTransition

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

Formats the value using the given formatter.

impl Eq for LexerTransition

impl PartialEq for LexerTransition

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LexerTransition