[−][src]Struct yarte_codegen::wasm::client::WASMCodeGen

pub struct WASMCodeGen<'a> { /* fields omitted */ }

Stack automaton for parse DOM representation and generate TokenStream Theory: https://core.ac.uk/download/pdf/82195817.pdf

Abstract

The stack automaton has a two-way input tape, a finite control and a stack. The stack is similar to a push-down store, in that writing and erasing occur only at the top. However, the stack head may also move up or down the stack in a read only mode. Here, nonerasing stack automata only, are considered. These are stack automata that never erase a symbol from their stack. It is shown that the deterministic, nonerasing stack automaton is equivalent to a deterministic, off-line Turing machine whose storage tape never grows beyond n logz n cells where n is the length of the input.

Deterministic it's equivalent n log n-bounded Turing Machine and that accepts context sensitive languages

Implementations

impl<'a> WASMCodeGen<'a>[src]

pub fn new<'n>(s: &'n Struct<'n>) -> WASMCodeGen<'n>[src]

Trait Implementations

impl<'a> CodeGen for WASMCodeGen<'a>[src]

Auto Trait Implementations

impl<'a> !RefUnwindSafe for WASMCodeGen<'a>

impl<'a> !Send for WASMCodeGen<'a>

impl<'a> !Sync for WASMCodeGen<'a>

impl<'a> Unpin for WASMCodeGen<'a>

impl<'a> !UnwindSafe for WASMCodeGen<'a>

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.