Struct ParserRecognizer

pub struct ParserRecognizer<'a> { /* private fields */ }

Implementations

impl<'a> ParserRecognizer<'a>

pub fn lexer(&mut self) -> &mut Lexer

pub fn lexer_state(&self) -> StateID

Trait Implementations

impl<'a> Recognizer for ParserRecognizer<'a>

fn pop_bytes(&mut self, num: usize)

for _ in 0..num { stack.pop() }

fn collapse(&mut self)

“Collapse” the stack so that it consists only of its former top element. X = stack.top(); stack.empty(); stack.push(X)

fn special_allowed(&mut self, _tok: SpecialToken) -> bool

check if stack.top() transitions via tok to a viable state

fn trie_started(&mut self)

Called when iteration over the trie is started

fn trie_finished(&mut self)

Called when iteration over the trie is finished Stack has exactly one element then, except when iteration started from non-root node. In that case, the stack may have more than one element, and trie_finished() needs to pop the excessive elements.

fn try_push_byte(&mut self, byte: u8) -> bool

This combines push_byte and byte_allowed into one function for performance.

fn byte_allowed(&mut self, byte: u8) -> bool

check if stack.top() transitions via byte to a viable state

fn get_error(&mut self) -> Option<String>

Check if there are any errors to be reported to the user.