localhots
/
kifflom
1
0
Fork 0
Code Releases Activity

Fix comments

This commit is contained in:
Gregory Eremin 2015-02-18 20:50:55 +07:00
parent 57f3043281
commit 7f547ce194
1 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
lexer/lexer.go
View File

@ -13,8 +13,8 @@ type (
// Holds the state of the scanner // Holds the state of the scanner
Lexer struct { Lexer struct {
input buffer.Bufferer input buffer.Bufferer
stack []rune stack []rune // Lexer stack
pos int pos int // Current stack position
lineNum int // Line number lineNum int // Line number
colNum int // Column number colNum int // Column number
startLine int // Start line of this item startLine int // Start line of this item
@ -58,7 +58,7 @@ const (
String String
) )
// Creates a new scanner for the input string // Creates a new scanner for the input buffer
func New(input buffer.Bufferer) *Lexer { func New(input buffer.Bufferer) *Lexer {
return &Lexer{ return &Lexer{
input: input, input: input,
@ -82,9 +82,10 @@ func (l *Lexer) NextItem() (item Item, ok bool) {
return return
} }
// Returns the next rune in the input // Returns the next rune in the stack
func (l *Lexer) next() rune { func (l *Lexer) next() rune {
var r rune var r rune
// Reading next rune from buffer
if l.pos > len(l.stack)-1 { if l.pos > len(l.stack)-1 {
l.stack = append(l.stack, l.input.Next()) l.stack = append(l.stack, l.input.Next())
} }
@ -107,14 +108,14 @@ func (l *Lexer) val() string {
return string(l.stack[:l.pos]) return string(l.stack[:l.pos])
} }
// Returns but does not consume the next rune in the input // Returns but does not consume the next rune in the stack
func (l *Lexer) peek() rune { func (l *Lexer) peek() rune {
r := l.next() r := l.next()
l.backup(1) l.backup(1)
return r return r
} }
// Tells if the following input matches the given string // Tells if the following stack matches the given string
func (l *Lexer) acceptString(s string) (ok bool) { func (l *Lexer) acceptString(s string) (ok bool) {
for i, c := range s { for i, c := range s {
if l.next() != c { if l.next() != c {
@ -133,7 +134,7 @@ func (l *Lexer) backup(n int) {
l.colNum -= n l.colNum -= n
} }
// Skips over the pending input before this point // Clears the stack items preceding the current position
func (l *Lexer) ignore() { func (l *Lexer) ignore() {
if l.pos < len(l.stack) { if l.pos < len(l.stack) {
l.stack = l.stack[l.pos:] l.stack = l.stack[l.pos:]
@ -157,7 +158,7 @@ func (l *Lexer) emit(t Token) {
Line: l.startLine, Line: l.startLine,
Column: l.startCol, Column: l.startCol,
} }
l.ignore() // Cleaning up input l.ignore() // Cleaning up stack
} }
// Emits an error token with given string as a value and stops lexing // Emits an error token with given string as a value and stops lexing