Struct TermParser 

pub struct TermParser<I>
where
    I: FusedIterator<Item = u8>,
{ /* private fields */ }

Implementations

impl<I> TermParser<I>

where I: FusedIterator<Item = u8>,

pub fn try_new(input: I, opers: Option<OperDefs>) -> Result<Self>

pub fn try_collect_terms(&mut self, arena: &mut Arena) -> Result<Vec<Term>>

pub fn try_next_term(&mut self, arena: &mut Arena) -> Result<Option<Term>>

pub fn define_opers<J: FusedIterator<Item = u8>>( &mut self, arena: &mut Arena, defs_input: J, opers: Option<OperDefs>, ) -> Result<()>

Trait Implementations

impl<I> Parser<Arena> for TermParser<I>

where I: FusedIterator<Item = u8>,

type Lexer = TermLexer<I>

The lexer used by this parser. Must be provided by the implementor and produce tokens compatible with ParserData::TokenID.

type ParserData = ParData

The parser data providing states, productions, tokens, and lookup tables. Must be provided by the implementor and be the struct generated by parlex-gen’s parser generator, ASLR.

fn ctx(&self) -> &ParserCtx<Self::Lexer, Self::ParserData, Arena>

Returns a shared reference to the parser context. Must be provided by the implementor and return &ParserCtx.

fn ctx_mut(&mut self) -> &mut ParserCtx<Self::Lexer, Self::ParserData, Arena>

Returns a mutable reference to the parser context. Must be provided by the implementor and return &mut ParserCtx.

fn stats(&self) -> ParserStats

Returns current parser statistics.

fn resolve_ambiguity( &mut self, _arena: &mut Arena, ambig: AmbigID, tok2: &TermToken, ) -> Result<Action>

Resolves an ambiguity using user-defined logic (e.g., precedence/associativity). Must be provided by the implementor.

fn reduce( &mut self, arena: &mut Arena, prod: ProdID, token: &TermToken, ) -> Result<()>

Performs a reduction for the specified production. Must be provided by the implementor.

fn tokens_peek<'a>( &'a self, index: usize, ) -> &'a <Self::Lexer as Lexer<U>>::Token

where U: 'a,

Returns a reference to a token counted from the end of the stack. 0 = last (top), 1 = second last, etc.

fn tokens_mut_peek<'a>( &'a mut self, index: usize, ) -> &'a mut <Self::Lexer as Lexer<U>>::Token

where U: 'a,

Returns a mutable reference to a token counted from the end of the stack. 0 = last (top), 1 = second last, etc.

fn tokens_pop(&mut self) -> Result<<Self::Lexer as Lexer<U>>::Token, Error>

Pops and returns the last (top) token from the stack.

fn tokens_push(&mut self, token: <Self::Lexer as Lexer<U>>::Token)

Pushes a token onto the stack.

fn dump_state(&self, incoming: &<Self::Lexer as Lexer<U>>::Token)

Traces the current parser state and token stack for debugging. Formats the stack with states and tokens, marking the incoming token with <-.

fn try_collect( &mut self, user_data: &mut U, ) -> Result<Vec<<Self::Lexer as Lexer<U>>::Token>, Error>

Attempts to collect all tokens until exhaustion.

fn try_next( &mut self, user_data: &mut U, ) -> Result<Option<<Self::Lexer as Lexer<U>>::Token>, Error>

Attempts to parse the input and produce the next reduced (accepted) token.