pub struct Table {
pub states: Vec<State>,
/* private fields */
}
Expand description
The parsing table generated by the IELR
algorithm.
Fields§
§states: Vec<State>
States of the parsing table.
Implementations§
source§impl Table
impl Table
sourcepub fn get_starting_state(&self, node: Node) -> Option<StateIdx>
pub fn get_starting_state(&self, node: Node) -> Option<StateIdx>
Get the starting state for node
if the table can start here.
sourcepub fn get_all_starts(&self) -> impl Iterator<Item = (Node, StateIdx)> + '_
pub fn get_all_starts(&self) -> impl Iterator<Item = (Node, StateIdx)> + '_
Get all possible starting nodes of this table, and their associated state.
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for Table
impl Send for Table
impl Sync for Table
impl Unpin for Table
impl UnwindSafe for Table
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more