example

package
v1.23.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 6, 2024 License: MIT Imports: 0 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Boat

type Boat struct{}

type Branch

type Branch struct{ L, R Tree }

type Car

type Car struct{}

type Leaf

type Leaf struct{ Value int }

type Lit added in v1.1.0

type Lit struct{ V int }

type Mul added in v1.1.0

type Mul struct{ Left, Right Calc }

type MyTriesMatch added in v1.16.0

type MyTriesMatch[T0, T1 Tree] interface {
	MatchLeafs(*Leaf, *Leaf)
	MatchBranches(*Branch, any)
	MatchMixed(any, any)
}

type One added in v1.9.0

type One struct{}

type Plane

type Plane struct{}

type Sum added in v1.1.0

type Sum struct{ Left, Right Calc }

Directories

Path Synopsis
Package ast defines the AST for simple language AST can be created either by parser or by hand, it's up to implementer to decide how to create AST This package provides few examples of AST creation mostly by parsing JSON - ast_sugar.go - ast_human_friendly.go - ast_description_of_best_result Much more advance parser is also possible, but it's not implemented here
Package ast defines the AST for simple language AST can be created either by parser or by hand, it's up to implementer to decide how to create AST This package provides few examples of AST creation mostly by parsing JSON - ast_sugar.go - ast_human_friendly.go - ast_description_of_best_result Much more advance parser is also possible, but it's not implemented here

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL