[−][src]Struct cfg::prediction::LastSets
FIRST sets.
Methods
impl LastSets
[src]
pub fn new<'a, G>(grammar: &'a G) -> Self where
G: ContextFree + EmptyRuleContainer,
&'b G: ContextFreeRef<'b, Target = G>,
G::History: Clone,
[src]
G: ContextFree + EmptyRuleContainer,
&'b G: ContextFreeRef<'b, Target = G>,
G::History: Clone,
Compute all LAST sets of the grammar.
We define a binary relation LAST(N, S), in which N is related to S
if the grammar has a production of the form N ⸬= α S β
, where
β is a nullable string of symbols.
We compute the transitive closure of this relation.
pub fn last_sets(&self) -> &PerSymbolSets
[src]
Returns a reference to FIRST sets.
Auto Trait Implementations
impl Send for LastSets
impl Sync for LastSets
impl Unpin for LastSets
impl UnwindSafe for LastSets
impl RefUnwindSafe for LastSets
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From<T> for T
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,