px

package

v0.4.0 Latest Latest Go to latest Published: Sep 9, 2025 License: MIT Imports: 5 Imported by: 0

Details

This section is empty.

This section is empty.

func ParseError[T tx.TokenKind](msg string, token tx.Token[T]) error

type Node[T tx.TokenKind, E NodeKind] struct {
	Token    tx.Token[T]
	Kind     E
	Parent   *Node[T, E]
	Children []*Node[T, E]
}

func (self *Node[T, E]) Push(nodes ...*Node[T, E])

func (self *Node[T, E]) SeqBreadthFirst() iter.Seq[*Node[T, E]]

SeqBreadthFirst performs a breadth-first traversal of the tree beginning at 'Node' 'self'. Each node is yielded one time.

Considering the below tree structure, in breadth-first order the sequence of nodes produced by the iterator would be: A, B, C, D, E, F, G, H.

       A
     ╱   ╲
    B     C
   ╱ ╲   ╱ ╲
  D   E F   G
 ╱
H

func (self *Node[T, E]) SeqDepthFirst() iter.Seq[*Node[T, E]]

SeqBreadthFirst performs a depth-first traversal of the tree beginning at 'Node' 'self'. Each node is yielded one time.

Considering the below tree structure, in depth-first order the sequence of nodes produced by the iterator would be: H, D, E, B, F, G, C, A.

       A
     ╱   ╲
    B     C
   ╱ ╲   ╱ ╲
  D   E F   G
 ╱
H

func (self *Node[T, E]) SetParent(n Node[T, E])

func (self *Node[T, E]) Value() []byte

type NodeKind interface{ comparable }

type Parser[T tx.TokenKind] struct {
	Tokens []tx.Token[T]
	Next   tx.Token[T]
	Pos    int32
}

func NewParser[T tx.TokenKind](tokens []tx.Token[T]) *Parser[T]

func (self *Parser[T]) Adv()

func (self *Parser[T]) Peek(ahead int) tx.Token[T]

func (self *Parser[T]) Revert(snapshot int32)

func (self *Parser[T]) Snapshot() int32