Enum AST

pub enum AST {
    Symbol(String),
    Data(Data),
    Block(Vec<Spanned<AST>>),
    Form(Vec<Spanned<AST>>),
    Group(Box<Spanned<AST>>),
    CSTPattern(ASTPattern),
    ArgPattern(ArgPattern),
    Tuple(Vec<Spanned<AST>>),
    Assign {
        pattern: Box<Spanned<ASTPattern>>,
        expression: Box<Spanned<AST>>,
    },
    Lambda {
        pattern: Box<Spanned<ASTPattern>>,
        expression: Box<Spanned<AST>>,
    },
    Composition {
        argument: Box<Spanned<AST>>,
        function: Box<Spanned<AST>>,
    },
    Label(String, Box<Spanned<AST>>),
    Syntax {
        arg_pat: Box<Spanned<ArgPattern>>,
        expression: Box<Spanned<AST>>,
    },
    FFI {
        name: String,
        expression: Box<Spanned<AST>>,
    },
}

Represents an item in a sugared AST. Which is the direct result of parsing Each syntax-level construct has it’s own AST variant. When macros are added, for instance, they will be here, But not in the CST, which is the desugared syntax tree, and represents language-level constructs

Variants

Symbol(String)

Data(Data)

Block(Vec<Spanned<AST>>)

Form(Vec<Spanned<AST>>)

Group(Box<Spanned<AST>>)

CSTPattern(ASTPattern)

ArgPattern(ArgPattern)

Tuple(Vec<Spanned<AST>>)

Assign

Fields

pattern: Box<Spanned<ASTPattern>>

expression: Box<Spanned<AST>>

Lambda

Fields

pattern: Box<Spanned<ASTPattern>>

expression: Box<Spanned<AST>>

Composition

Fields

argument: Box<Spanned<AST>>

function: Box<Spanned<AST>>

Label(String, Box<Spanned<AST>>)

Syntax

Fields

arg_pat: Box<Spanned<ArgPattern>>

expression: Box<Spanned<AST>>

FFI

Fields

name: String

expression: Box<Spanned<AST>>

Implementations

impl AST

pub fn assign(pattern: Spanned<ASTPattern>, expression: Spanned<AST>) -> AST

Shortcut for creating an AST::Assign variant.

pub fn lambda(pattern: Spanned<ASTPattern>, expression: Spanned<AST>) -> AST

Shortcut for creating an AST::Lambda variant.

pub fn composition(argument: Spanned<AST>, function: Spanned<AST>) -> AST

Shortcut for creating an AST::Composition variant.

pub fn syntax(arg_pat: Spanned<ArgPattern>, expression: Spanned<AST>) -> AST

Shortcut for creating an AST::Syntax variant. i.e. a macro definition

pub fn label(name: &str, expression: Spanned<AST>) -> AST

Shortcut for creating a AST::Label variant.

pub fn ffi(name: &str, expression: Spanned<AST>) -> AST

Shortcut for creating an AST::FFI variant.

pub fn group(expression: Spanned<AST>) -> AST

Shortcut for creating an AST::Group variant.

Trait Implementations

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 for AST

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl TryFrom<AST> for ASTPattern

fn try_from(ast: AST) -> Result<Self, Self::Error>

Tries to convert an AST into a CSTPattern. CSTPatterns mirror the ASTs they are designed to destructure. During parsing, they are just parsed as ASTs - When the compiler can determine that an AST is actually a pattern, It performs this conversion.

type Error = String

The type returned in the event of a conversion error.

impl TryFrom<AST> for ArgPattern

fn try_from(ast: AST) -> Result<Self, Self::Error>

Like ASTPatterns, ArgPatterns are represented as ASTs, Then converted into ArgPatterns when the compiler determines it so.

type Error = String

The type returned in the event of a conversion error.

impl StructuralPartialEq for AST