Struct hime_redist::ast::Ast

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

Represents a simple AST with a tree structure The nodes are stored in sequential arrays where the children of a node are an inner sequence. The linkage is represented by each node storing its number of children and the index of its first child.

Implementations

impl<'a> Ast<'a>

pub fn new(
    tokens: TokenRepository<'a>,
    variables: &'static [Symbol],
    virtuals: &'static [Symbol],
    data: &'a AstImpl
) -> Ast<'a>

Creates a new AST proxy structure

pub fn new_mut(
    variables: &'static [Symbol],
    virtuals: &'static [Symbol],
    data: &'a mut AstImpl
) -> Ast<'a>

Creates a new AST proxy structure

pub fn get_variables(&self) -> &'static [Symbol]

Gets the grammar variables for this AST

pub fn get_virtuals(&self) -> &'static [Symbol]

Gets the grammar virtuals for this AST

pub fn has_root(&self) -> bool

Gets whether a root has been defined for this AST

pub fn get_root(&self) -> AstNode<'_>

Gets the root node of this tree

pub fn get_node(&self, id: usize) -> AstNode<'_>

Gets a specific node in this tree

pub fn find_node_for(&self, token: &Token<'a>) -> Option<AstNode<'_>>

Gets the AST node (if any) that has the specified token as label

pub fn find_node_at_index(&self, index: usize) -> Option<AstNode<'_>>

Gets the AST node (if any) that has a token label that contains the specified index in the input text

pub fn find_node_at_position(
    &self,
    position: TextPosition
) -> Option<AstNode<'_>>

Gets the AST node (if any) that has a token label that contains the specified index in the input text

pub fn find_parent_of(&self, node: usize) -> Option<AstNode<'_>>

Gets the parent of the specified node, if any

pub fn store(&mut self, nodes: &Vec<AstCell>, index: usize, count: usize) -> usize

Stores some children nodes in this AST

pub fn store_root(&mut self, node: AstCell)

Stores the root of this tree