affine/SHS
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fixed recursive case for lexing a list

Browse source
This commit is contained in:
Aidan Hahn 2019-11-18 23:24:33 -08:00
parent d38f53208b
commit cb84db53d8
No known key found for this signature in database
GPG key ID: 327711E983899316
1 changed files with 12 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

11
pkg/shsh/token.go
View file

@ -16,6 +16,7 @@ func Lex(input string) Token {
delim := ' ' delim := ' '
var tok strings.Builder var tok strings.Builder
iter_alloced := false iter_alloced := false
is_list = false;
for pos, char := range input { for pos, char := range input {
switch char { switch char {
@ -23,11 +24,21 @@ func Lex(input string) Token {
case '\'', '"', '`': case '\'', '"', '`':
delim = char delim = char
case '(': case '(':
is_list = true
delim = ')' delim = ')'
case delim: case delim:
*iter = new(Token) *iter = new(Token)
if is_list {
// TODO: Pass a pointer out of Lex and store a pointer
*iter._inner = Lex(tok.String())
is_list = false
} else {
// TODO: Store a pointer to the contents of the stringbuilder
*iter._inner = tok.String() *iter._inner = tok.String()
}
iter_alloced = true iter_alloced = true
delim = ' ' delim = ' '