You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

194 lines
3.2 KiB
Go

10 years ago
package main
import (
"errors"
"fmt"
"io"
"strings"
10 years ago
"unicode"
10 years ago
)
type tokenType int
const (
t_error tokenType = iota // a stored lex error
t_string // a string literal
10 years ago
t_name // a name
10 years ago
t_type // a type
t_equals // equals sign
10 years ago
)
type stateFn func(*lexer) (stateFn, error)
type token struct {
t tokenType
s string
}
type lexer struct {
10 years ago
in io.RuneReader
out chan token
buf []rune // running buffer for current lexeme
backup []rune
10 years ago
}
func (l *lexer) lex() {
defer close(l.out)
var err error
fn := lexRoot
for {
fn, err = fn(l)
switch err {
case nil:
case io.EOF:
return
default:
l.out <- token{t_error, err.Error()}
return
}
}
}
func (l *lexer) next() (rune, error) {
10 years ago
if len(l.backup) > 0 {
r := l.backup[len(l.backup)-1]
l.backup = l.backup[:len(l.backup)-1]
return r, nil
}
10 years ago
r, _, err := l.in.ReadRune()
return r, err
}
func (l *lexer) keep(r rune) {
if l.buf == nil {
l.buf = make([]rune, 0, 18)
}
l.buf = append(l.buf, r)
}
10 years ago
func (l *lexer) unread(r rune) {
l.backup = append(l.backup, r)
}
10 years ago
func (l *lexer) emit(t tokenType) {
l.out <- token{t, string(l.buf)}
l.buf = l.buf[0:0]
}
func lexString(in string) chan token {
r := strings.NewReader(in)
return lex(r)
}
func lex(r io.RuneReader) chan token {
l := lexer{
10 years ago
in: r,
out: make(chan token),
backup: make([]rune, 0, 4),
10 years ago
}
go l.lex()
return l.out
}
func fullTokens(c chan token) ([]token, error) {
tokens := make([]token, 0, 32)
for t := range c {
if t.t == t_error {
return nil, errors.New(t.s)
}
tokens = append(tokens, t)
}
return tokens, nil
}
func lexRoot(l *lexer) (stateFn, error) {
r, err := l.next()
if err != nil {
return nil, err
}
10 years ago
switch {
case r == '=':
l.keep(r)
l.emit(t_equals)
return lexRoot, nil
10 years ago
case r == '"', r == '`':
10 years ago
return lexStringLiteral(r), nil
10 years ago
case unicode.IsSpace(r):
return lexRoot, nil
case unicode.IsLower(r):
l.keep(r)
return lexName, nil
10 years ago
case unicode.IsUpper(r):
l.keep(r)
return lexType, nil
10 years ago
default:
return nil, fmt.Errorf("unexpected rune in lexRoot: %c", r)
}
}
func lexStringLiteral(delim rune) stateFn {
return func(l *lexer) (stateFn, error) {
r, err := l.next()
if err != nil {
return nil, err
}
switch r {
case delim:
l.emit(t_string)
return lexRoot, nil
case '\\':
r, err := l.next()
if err != nil {
return nil, err
}
l.keep(r)
return lexStringLiteral(delim), nil
default:
l.keep(r)
return lexStringLiteral(delim), nil
}
}
}
10 years ago
func lexName(l *lexer) (stateFn, error) {
r, err := l.next()
switch err {
case io.EOF:
l.emit(t_name)
return nil, io.EOF
case nil:
default:
10 years ago
return nil, err
}
10 years ago
switch {
case unicode.IsLetter(r), unicode.IsDigit(r), r == '_':
10 years ago
l.keep(r)
return lexName, nil
10 years ago
default:
l.emit(t_name)
l.unread(r)
return lexRoot, nil
}
}
func lexType(l *lexer) (stateFn, error) {
r, err := l.next()
switch err {
case io.EOF:
l.emit(t_type)
return nil, io.EOF
case nil:
default:
10 years ago
return nil, err
}
switch {
case unicode.IsLetter(r), unicode.IsDigit(r), r == '_':
l.keep(r)
return lexType, nil
default:
l.emit(t_type)
l.unread(r)
return lexRoot, nil
10 years ago
}
}