Enum lrpar::ParseRepair

pub enum ParseRepair<LexemeT: Lexeme<StorageT>, StorageT: Hash> {
    Insert(TIdx<StorageT>),
    Delete(LexemeT),
    Shift(LexemeT),
}

After a parse error is encountered, the parser attempts to find a way of recovering. Each entry in the sequence of repairs is represented by a ParseRepair.

Variants

Insert(TIdx<StorageT>)

Insert a Symbol::Token.

Delete(LexemeT)

Delete a symbol.

Shift(LexemeT)

Shift a symbol.

Trait Implementations

impl<LexemeT: Clone + Lexeme<StorageT>, StorageT: Clone + Hash> Clone for ParseRepair<LexemeT, StorageT>

fn clone(&self) -> ParseRepair<LexemeT, StorageT>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<LexemeT: Debug + Lexeme<StorageT>, StorageT: Debug + Hash> Debug for ParseRepair<LexemeT, StorageT>

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

Formats the value using the given formatter.

impl<LexemeT: Hash + Lexeme<StorageT>, StorageT: Hash + Hash> Hash for ParseRepair<LexemeT, StorageT>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<LexemeT: PartialEq + Lexeme<StorageT>, StorageT: PartialEq + Hash> PartialEq for ParseRepair<LexemeT, StorageT>

fn eq(&self, other: &ParseRepair<LexemeT, StorageT>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<LexemeT: Eq + Lexeme<StorageT>, StorageT: Eq + Hash> Eq for ParseRepair<LexemeT, StorageT>

impl<LexemeT: Lexeme<StorageT>, StorageT: Hash> StructuralPartialEq for ParseRepair<LexemeT, StorageT>