Struct leo_asg::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_name: &str, grammar: &Grammar<'ast>) -> Result<Ast, AstError>

Creates a new AST from a given program name and grammar tree.

pub fn as_repr(&self) -> &Program

Returns a reference to the inner program AST representation.

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

Serializes the ast into a JSON string.

pub fn from_json_string(json: &str) -> Result<Ast, Error>

Deserializes the JSON string into a ast.

Trait Implementations

impl Debug for Ast

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

Formats the value using the given formatter.

impl Eq for Ast

impl PartialEq<Ast> for Ast

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

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

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

This method tests for !=.

impl StructuralEq for Ast

impl StructuralPartialEq for Ast