Struct leo_ast::Ast

pub struct Ast { /* fields omitted */ }

The abstract syntax tree (AST) for a Leo program.

The Ast type represents a Leo program as a series of recursive data types. These data types form a tree that begins from a Program type root.

A new Ast can be created from a [Grammar] generated by the pest parser in the grammar module.

Implementations

impl Ast

pub fn new(program: Program) -> Self

Creates a new AST from a given program tree.

pub fn canonicalize(&mut self) -> Result<(), AstError>

Mutates the program ast by preforming canonicalization on it.

pub fn as_repr(&self) -> &Program

Returns a reference to the inner program AST representation.

pub fn into_repr(self) -> Program

pub fn to_json_string(&self) -> Result<String, AstError>

Serializes the ast into a JSON string.

pub fn to_json_file(
    &self,
    path: PathBuf,
    file_name: &str
) -> Result<(), AstError>

pub fn from_json_string(json: &str) -> Result<Self, AstError>

Deserializes the JSON string into a ast.

pub fn from_json_file(path: PathBuf) -> Result<Self, AstError>

Trait Implementations

impl AsRef<Program> for Ast

fn as_ref(&self) -> &Program

Performs the conversion.

impl Clone for Ast

fn clone(&self) -> Ast

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Ast

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

Formats the value using the given formatter.

impl PartialEq<Ast> for Ast

fn eq(&self, other: &Ast) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl Eq for Ast

impl StructuralEq for Ast

impl StructuralPartialEq for Ast