items

Documentation

Overview

Package items computes the lexical item sets, following

Modern Compiler Design. Second Edition. Grune et al Springer 2012 Section 2.6

Index

• type Event
• type Set
  • func (set *Set) Accept(slits *stringset.StringSet) string
  • func (set *Set) Add(items ...*item.Item)
  • func (set *Set) Contains(item *item.Item) bool
  • func (set *Set) Equals(other *Set) bool
  • func (set *Set) Items() []*item.Item
  • func (s *Set) Len() int
  • func (s *Set) Less(i, j int) bool
  • func (set *Set) String() string
  • func (s *Set) Swap(i, j int)
• type Sets
  • func New(g *ast.GoGLL) *Sets
  • func (sets *Sets) GetExisting(set *Set) *Set
  • func (sets *Sets) Len() int
  • func (sets *Sets) Set(i int) *Set
  • func (sets *Sets) Sets() []*Set
• type Transition

Types

type Event

type Event interface {
}

type Set

type Set struct {
	No int

	Transitions []*Transition
	// contains filtered or unexported fields
}

func (*Set) Accept

func (set *Set) Accept(slits *stringset.StringSet) string

Accept returns the token type accepted by the first reduce item in set slits is the set of string literals from the AST

func (*Set) Add

func (set *Set) Add(items ...*item.Item)

func (*Set) Contains

func (set *Set) Contains(item *item.Item) bool

func (*Set) Equals

func (set *Set) Equals(other *Set) bool

func (*Set) Items

func (set *Set) Items() []*item.Item

func (*Set) Len

func (s *Set) Len() int

func (*Set) Less

func (s *Set) Less(i, j int) bool

func (*Set) String

func (set *Set) String() string

func (*Set) Swap

func (s *Set) Swap(i, j int)

type Sets

type Sets struct {
	// contains filtered or unexported fields
}

func New

func New(g *ast.GoGLL) *Sets

func (*Sets) GetExisting

func (sets *Sets) GetExisting(set *Set) *Set

func (*Sets) Len

func (sets *Sets) Len() int

Len returns the number of sets in sets

func (*Sets) Set

func (sets *Sets) Set(i int) *Set

func (*Sets) Sets

func (sets *Sets) Sets() []*Set

type Transition

type Transition struct {
	Event ast.LexBase
	To    *Set
}