serene-golang-implementation/bootstrap/pkg/ast/ast.go

154 lines
2.8 KiB
Go

/*
Serene --- Yet an other Lisp
Copyright (c) 2020 Sameer Rahmani <lxsameer@gnu.org>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
// Package ast provides the functionality and data structures around the
// Serene's AST.
package ast
import (
"sort"
"strings"
)
type NodeType int
const (
Nil NodeType = iota
Nothing
True
False
Instruction
Symbol
Keyword
Number
List
Fn
NativeFn
Namespace
String
Block // Dont' mistake it with block from other programming languages
)
type Source struct {
Buffer *[]string
// It can be the path to the source file or something like "*in*"
// for standard in
Path string
LineIndex *[]int
}
func (s *Source) GetLine(linenum int) string {
lines := strings.Split(strings.Join(*s.Buffer, ""), "\n")
return lines[linenum-1]
}
func (s *Source) LineNumberFor(pos int) int {
if pos < 0 {
return -1
}
return sort.Search(len(*s.LineIndex), func(i int) bool {
if i == 0 {
return pos < (*s.LineIndex)[i]
} else {
return (*s.LineIndex)[i-1] < pos && pos < (*s.LineIndex)[i]
}
})
}
type Location struct {
start int
end int
source Source
knownLocation bool
}
var UnknownLocation *Location = &Location{knownLocation: false}
func (l *Location) GetStart() int {
return l.start
}
func (l *Location) GetEnd() int {
return l.end
}
func (l *Location) GetSource() *Source {
return &l.source
}
func (l *Location) IncStart(x int) {
if x+l.start < len(*l.source.Buffer) {
l.start += x
} else {
l.start = len(*l.source.Buffer) - 1
}
}
func (l *Location) DecStart(x int) {
if l.start-x >= 0 {
l.start -= x
} else {
l.start = 0
}
}
func (l *Location) IncEnd(x int) {
if x+l.end < len(*l.source.Buffer) {
l.end += x
} else {
l.end = len(*l.source.Buffer) - 1
}
}
func (l *Location) DecEnd(x int) {
if l.end-x >= 0 {
l.end -= x
} else {
l.end = 0
}
}
func (l *Location) IsKnownLocaiton() bool {
return l.knownLocation
}
type ILocatable interface {
GetLocation() *Location
}
func MakeLocation(input *Source, start int, end int) *Location {
return &Location{
source: *input,
start: start,
end: end,
knownLocation: true,
}
}
type ITypable interface {
GetType() NodeType
}
func MakeUnknownLocation() *Location {
return UnknownLocation
}