maride/php-parser
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
b84c35f413
php-parser/lexer.l

622 lines
27 KiB
Plaintext
Raw Normal View History

first commit
2017-11-07 06:21:38 +00:00
%{
// Copyright (c) 2011 CZ.NIC z.s.p.o. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// blame: jnml, labs.nic.cz
package main
import (
"bufio"
"go/token"
"io"
"unicode"
"fmt"
base heredoc handler
2017-11-16 17:00:34 +00:00
"bytes"
first commit
2017-11-07 06:21:38 +00:00
"github.com/cznic/golex/lex"
)
// Allocate Character classes anywhere in [0x80, 0xFF].
const (
classUnicodeLeter = iota + 0x80
classUnicodeDigit
classOther
)
var sc int
const (
INITIAL = iota
PHP
STRING
tmp
2017-11-13 07:48:57 +00:00
STRING_VAR
STRING_VAR_INDEX
full lex double quoted strings
2017-11-15 22:05:44 +00:00
STRING_VAR_NAME
common tokens
2017-11-16 10:53:21 +00:00
PROPERTY
base heredoc handler
2017-11-16 17:00:34 +00:00
HEREDOC_END
nodoc
2017-11-16 17:58:46 +00:00
NOWDOC
handle heredoc statements
2017-11-20 10:22:03 +00:00
HEREDOC
handle backquote statements
2017-11-20 10:33:18 +00:00
BACKQUOTE
first commit
2017-11-07 06:21:38 +00:00
)
full lex double quoted strings
2017-11-15 22:05:44 +00:00
first commit
2017-11-07 06:21:38 +00:00
type lexer struct {
*lex.Lexer
}
full lex double quoted strings
2017-11-15 22:05:44 +00:00
var stateStack = []int{PHP}
base heredoc handler
2017-11-16 17:00:34 +00:00
var heredocLabel []byte
full lex double quoted strings
2017-11-15 22:05:44 +00:00
func pushState(state int) {
sc = state
stateStack = append(stateStack, state)
}
func popState() {
len := len(stateStack)
if len <= 1 {
return
}
sc = stateStack[len - 2]
stateStack = stateStack[:len-1]
}
func begin(state int) {
handle heredoc statements
2017-11-20 10:22:03 +00:00
len := len(stateStack)
stateStack = stateStack[:len-1]
stateStack = append(stateStack, state)
full lex double quoted strings
2017-11-15 22:05:44 +00:00
sc = state
first commit
2017-11-07 06:21:38 +00:00
}
func rune2Class(r rune) int {
if r >= 0 && r < 0x80 { // Keep ASCII as it is.
return int(r)
}
if unicode.IsLetter(r) {
return classUnicodeLeter
}
if unicode.IsDigit(r) {
return classUnicodeDigit
}
parser, first try
2017-11-23 15:33:47 +00:00
// return classOther
return -1
first commit
2017-11-07 06:21:38 +00:00
}
func newLexer(src io.Reader, dst io.Writer, fName string) *lexer {
file := token.NewFileSet().AddFile(fName, -1, 1<<31-1)
lx, err := lex.New(file, bufio.NewReader(src), lex.RuneClass(rune2Class))
if (err != nil) { panic(err) }
return &lexer{lx}
}
func (l *lexer) unget(r rune) []byte{
l.Unget(l.Lookahead())
chars := l.Token();
lastChar := chars[len(chars)-1];
if lastChar.Rune != r {
return l.TokenBytes(nil)
}
l.Unget(lastChar);
buf := l.TokenBytes(nil)
buf = buf[:len(buf)-1]
return buf
}
lex string template
2017-11-12 11:13:31 +00:00
func (l *lexer) ungetN(n int) []byte{
l.Unget(l.Lookahead())
chars := l.Token();
for i := 1; i <= n; i++ {
char := chars[len(chars)-i];
l.Unget(char);
}
buf := l.TokenBytes(nil)
buf = buf[:len(buf)-n]
return buf
}
parser, first try
2017-11-23 15:33:47 +00:00
func (l *lexer) Lex(lval *yySymType) int { // Lex(lval *yySymType)
first commit
2017-11-07 06:21:38 +00:00
c := l.Enter()
%}
handle backquote statements
2017-11-20 10:33:18 +00:00
%s PHP STRING STRING_VAR STRING_VAR_INDEX STRING_VAR_NAME PROPERTY HEREDOC_END NOWDOC HEREDOC BACKQUOTE
first commit
2017-11-07 06:21:38 +00:00
%yyb last == '\n' || last = '\0'
%yyt sc
%yyc c
%yyn c = l.Next()
%yym l.Mark()
common tokens
2017-11-16 10:53:21 +00:00
LNUM [0-9]+
DNUM ([0-9]*"."[0-9]+)|([0-9]+"."[0-9]*)
HNUM 0x[0-9a-fA-F]+
BNUM 0b[01]+
EXPONENT_DNUM (({LNUM}|{DNUM})[eE][+-]?{LNUM})
VAR_NAME [a-zA-Z_\x7f-\xff][a-zA-Z0-9_\x7f-\xff]*
OPERATORS [;:,.\[\]()|\/\^&\+-*=%!~$<>?@]
start heredoc
2017-11-16 14:50:55 +00:00
NEW_LINE (\r|\n|\r\n)
first commit
2017-11-07 06:21:38 +00:00
%%
c = l.Rule0()
<INITIAL>[ \t\n\r]+
<INITIAL>.
parser, first try
2017-11-23 15:33:47 +00:00
<INITIAL>\<\?php([ \t]|{NEW_LINE}) begin(PHP);//lval.token = string(l.TokenBytes(nil)); return T_OPEN_TAG;
<INITIAL>\<\? begin(PHP);//lval.token = string(l.TokenBytes(nil)); return T_OPEN_TAG;
<INITIAL>\<\?= begin(PHP);lval.token = string(l.TokenBytes(nil)); return T_OPEN_TAG_WITH_ECHO;
common tokens
2017-11-16 10:53:21 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>[ \t\n\r]+ //lval.token = string(l.TokenBytes(nil)); return T_WHITESPACE
<PHP>\?\>{NEW_LINE}? begin(INITIAL);lval.token = string(l.TokenBytes(nil)); return T_CLOSE_TAG;
handle numbers
2017-11-20 11:50:30 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>{DNUM}|{EXPONENT_DNUM} lval.token = string(l.TokenBytes(nil)); return T_DNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
<PHP>{BNUM}
tb := l.TokenBytes(nil)
i:=2
BNUMFOR:for {
switch tb[i] {
case '0': i++;
default: break BNUMFOR;
}
}
if len(tb) - i < 64 {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_LNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
} else {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_DNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
}
<PHP>{LNUM}
if len(l.TokenBytes(nil)) < 20 {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_LNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
} else {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_DNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
}
<PHP>{HNUM}
tb := l.TokenBytes(nil)
i:=2
HNUMFOR:for {
switch tb[i] {
case '0': i++;
default: break HNUMFOR;
}
}
length := len(tb) - i
if length < 16 || (length == 16 && tb[i] <= '7') {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_LNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
} else {
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_DNUMBER
handle numbers
2017-11-20 11:50:30 +00:00
}
common tokens
2017-11-16 10:53:21 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>abstract lval.token = string(l.TokenBytes(nil)); return T_ABSTRACT
<PHP>array lval.token = string(l.TokenBytes(nil)); return T_ARRAY
<PHP>as lval.token = string(l.TokenBytes(nil)); return T_AS
<PHP>break lval.token = string(l.TokenBytes(nil)); return T_BREAK
<PHP>callable lval.token = string(l.TokenBytes(nil)); return T_CALLABLE
<PHP>case lval.token = string(l.TokenBytes(nil)); return T_CASE
<PHP>catch lval.token = string(l.TokenBytes(nil)); return T_CATCH
<PHP>class lval.token = string(l.TokenBytes(nil)); return T_CLASS
<PHP>clone lval.token = string(l.TokenBytes(nil)); return T_CLONE
<PHP>const lval.token = string(l.TokenBytes(nil)); return T_CONST;
<PHP>continue lval.token = string(l.TokenBytes(nil)); return T_CONTINUE;
<PHP>declare lval.token = string(l.TokenBytes(nil)); return T_DECLARE;
<PHP>default lval.token = string(l.TokenBytes(nil)); return T_DEFAULT;
<PHP>do lval.token = string(l.TokenBytes(nil)); return T_DO;
<PHP>echo lval.token = string(l.TokenBytes(nil)); return T_ECHO;
<PHP>else lval.token = string(l.TokenBytes(nil)); return T_ELSE;
<PHP>elseif lval.token = string(l.TokenBytes(nil)); return T_ELSEIF;
<PHP>empty lval.token = string(l.TokenBytes(nil)); return T_EMPTY;
<PHP>endfor lval.token = string(l.TokenBytes(nil)); return T_ENDFOR
<PHP>endforeach lval.token = string(l.TokenBytes(nil)); return T_ENDFOREACH
<PHP>endif lval.token = string(l.TokenBytes(nil)); return T_ENDIF
<PHP>endswitch lval.token = string(l.TokenBytes(nil)); return T_ENDSWITCH
<PHP>endwhile lval.token = string(l.TokenBytes(nil)); return T_ENDWHILE
<PHP>eval lval.token = string(l.TokenBytes(nil)); return T_EVAL
<PHP>exit|die lval.token = string(l.TokenBytes(nil)); return T_EXIT
<PHP>extends lval.token = string(l.TokenBytes(nil)); return T_EXTENDS
<PHP>final lval.token = string(l.TokenBytes(nil)); return T_FINAL
<PHP>finally lval.token = string(l.TokenBytes(nil)); return T_FINALLY
<PHP>for lval.token = string(l.TokenBytes(nil)); return T_FOR
<PHP>foreach lval.token = string(l.TokenBytes(nil)); return T_FOREACH
<PHP>function|cfunction lval.token = string(l.TokenBytes(nil)); return T_FUNCTION
<PHP>global lval.token = string(l.TokenBytes(nil)); return T_GLOBAL
<PHP>goto lval.token = string(l.TokenBytes(nil)); return T_GOTO
<PHP>if lval.token = string(l.TokenBytes(nil)); return T_IF
<PHP>isset lval.token = string(l.TokenBytes(nil)); return T_ISSET
<PHP>implements lval.token = string(l.TokenBytes(nil)); return T_IMPLEMENTS
<PHP>instanceof lval.token = string(l.TokenBytes(nil)); return T_INSTANCEOF
<PHP>insteadof lval.token = string(l.TokenBytes(nil)); return T_INSTEADOF
<PHP>interface lval.token = string(l.TokenBytes(nil)); return T_INTERFACE
<PHP>list lval.token = string(l.TokenBytes(nil)); return T_LIST
<PHP>namespace lval.token = string(l.TokenBytes(nil)); return T_NAMESPACE
<PHP>private lval.token = string(l.TokenBytes(nil)); return T_PRIVATE
<PHP>public lval.token = string(l.TokenBytes(nil)); return T_PUBLIC
<PHP>print lval.token = string(l.TokenBytes(nil)); return T_PRINT
<PHP>protected lval.token = string(l.TokenBytes(nil)); return T_PROTECTED
<PHP>return lval.token = string(l.TokenBytes(nil)); return T_RETURN
<PHP>static lval.token = string(l.TokenBytes(nil)); return T_STATIC
<PHP>switch lval.token = string(l.TokenBytes(nil)); return T_SWITCH
<PHP>throw lval.token = string(l.TokenBytes(nil)); return T_THROW
<PHP>trait lval.token = string(l.TokenBytes(nil)); return T_TRAIT
<PHP>try lval.token = string(l.TokenBytes(nil)); return T_TRY
<PHP>unset lval.token = string(l.TokenBytes(nil)); return T_UNSET
<PHP>use lval.token = string(l.TokenBytes(nil)); return T_USE
<PHP>var lval.token = string(l.TokenBytes(nil)); return T_VAR
<PHP>while lval.token = string(l.TokenBytes(nil)); return T_WHILE
<PHP>yield[ \t\n\r]+from[^a-zA-Z0-9_\x80-\xff] lval.token = string(l.TokenBytes(nil)); return T_YIELD_FROM
<PHP>yield lval.token = string(l.TokenBytes(nil)); return T_YIELD
<PHP>include lval.token = string(l.TokenBytes(nil)); return T_INCLUDE
<PHP>include_once lval.token = string(l.TokenBytes(nil)); return T_INCLUDE_ONCE
<PHP>require lval.token = string(l.TokenBytes(nil)); return T_REQUIRE
<PHP>require_once lval.token = string(l.TokenBytes(nil)); return T_REQUIRE_ONCE
<PHP>__CLASS__ lval.token = string(l.TokenBytes(nil)); return T_CLASS_C
<PHP>__DIR__ lval.token = string(l.TokenBytes(nil)); return T_DIR
<PHP>__FILE__ lval.token = string(l.TokenBytes(nil)); return T_FILE
<PHP>__FUNCTION__ lval.token = string(l.TokenBytes(nil)); return T_FUNC_C
<PHP>__LINE__ lval.token = string(l.TokenBytes(nil)); return T_LINE
<PHP>__NAMESPACE__ lval.token = string(l.TokenBytes(nil)); return T_NS_C
<PHP>__METHOD__ lval.token = string(l.TokenBytes(nil)); return T_METHOD_C
<PHP>__TRAIT__ lval.token = string(l.TokenBytes(nil)); return T_TRAIT_C
<PHP>__halt_compiler lval.token = string(l.TokenBytes(nil)); return T_HALT_COMPILER
<PHP>\([ \t]*array[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_ARRAY_CAST
<PHP>\([ \t]*(bool|boolean)[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_BOOL_CAST
<PHP>\([ \t]*(real|double|float)[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_DOUBLE_CAST
<PHP>\([ \t]*(int|integer)[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_INT_CAST
<PHP>\([ \t]*object[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_OBJECT_CAST
<PHP>\([ \t]*string[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_STRING_CAST
<PHP>\([ \t]*unset[ \t]*\) lval.token = string(l.TokenBytes(nil)); return T_UNSET_CAST
<PHP>new lval.token = string(l.TokenBytes(nil)); return T_NEW
<PHP>and lval.token = string(l.TokenBytes(nil)); return T_LOGICAL_AND
<PHP>or lval.token = string(l.TokenBytes(nil)); return T_LOGICAL_OR
<PHP>xor lval.token = string(l.TokenBytes(nil)); return T_LOGICAL_XOR
<PHP>\\ lval.token = string(l.TokenBytes(nil)); return T_NS_SEPARATOR
<PHP>\.\.\. lval.token = string(l.TokenBytes(nil)); return T_ELLIPSIS;
<PHP>:: lval.token = string(l.TokenBytes(nil)); return T_PAAMAYIM_NEKUDOTAYIM; // T_DOUBLE_COLON
<PHP>&& lval.token = string(l.TokenBytes(nil)); return T_BOOLEAN_AND
<PHP>\|\| lval.token = string(l.TokenBytes(nil)); return T_BOOLEAN_OR
<PHP>&= lval.token = string(l.TokenBytes(nil)); return T_AND_EQUAL
<PHP>\|= lval.token = string(l.TokenBytes(nil)); return T_OR_EQUAL
<PHP>\.= lval.token = string(l.TokenBytes(nil)); return T_CONCAT_EQUAL;
<PHP>\*= lval.token = string(l.TokenBytes(nil)); return T_MUL_EQUAL
<PHP>\*\*= lval.token = string(l.TokenBytes(nil)); return T_POW_EQUAL
<PHP>[/]= lval.token = string(l.TokenBytes(nil)); return T_DIV_EQUAL;
<PHP>\+= lval.token = string(l.TokenBytes(nil)); return T_PLUS_EQUAL
<PHP>-= lval.token = string(l.TokenBytes(nil)); return T_MINUS_EQUAL
<PHP>\^= lval.token = string(l.TokenBytes(nil)); return T_XOR_EQUAL
<PHP>%= lval.token = string(l.TokenBytes(nil)); return T_MOD_EQUAL
<PHP>-- lval.token = string(l.TokenBytes(nil)); return T_DEC;
<PHP>\+\+ lval.token = string(l.TokenBytes(nil)); return T_INC
<PHP>=> lval.token = string(l.TokenBytes(nil)); return T_DOUBLE_ARROW;
<PHP>\<=\> lval.token = string(l.TokenBytes(nil)); return T_SPACESHIP
<PHP>\!=|\<\> lval.token = string(l.TokenBytes(nil)); return T_IS_NOT_EQUAL
<PHP>\!== lval.token = string(l.TokenBytes(nil)); return T_IS_NOT_IDENTICAL
<PHP>== lval.token = string(l.TokenBytes(nil)); return T_IS_EQUAL
<PHP>=== lval.token = string(l.TokenBytes(nil)); return T_IS_IDENTICAL
<PHP>\<\<= lval.token = string(l.TokenBytes(nil)); return T_SL_EQUAL
<PHP>\>\>= lval.token = string(l.TokenBytes(nil)); return T_SR_EQUAL
<PHP>\>= lval.token = string(l.TokenBytes(nil)); return T_IS_GREATER_OR_EQUAL
<PHP>\<= lval.token = string(l.TokenBytes(nil)); return T_IS_SMALLER_OR_EQUAL
<PHP>\*\* lval.token = string(l.TokenBytes(nil)); return T_POW
<PHP>\<\< lval.token = string(l.TokenBytes(nil)); return T_SL
<PHP>\>\> lval.token = string(l.TokenBytes(nil)); return T_SR
add T_COALESCE
2017-11-23 22:20:13 +00:00
<PHP>\?\? lval.token = string(l.TokenBytes(nil)); return T_COALESCE
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>(#|[/][/]){NEW_LINE} lval.token = string(l.TokenBytes(nil)); return T_COMMENT; // TODO: handle ?>
<PHP>[/][*][^*]*[*]+([^*/][^*]*[*]+)*[/] lval.token = string(l.TokenBytes(nil)); return T_COMMENT; // TODO: handle ?>
<PHP>[/][*][*][^*]*[*]+([^*/][^*]*[*]+)*[/] lval.token = string(l.TokenBytes(nil)); return T_DOC_COMMENT; // TODO: handle ?>
<PHP>'[^']*(\\')*' lval.token = string(l.TokenBytes(nil)); return T_CONSTANT_ENCAPSED_STRING
parse namespace
2017-11-24 01:36:58 +00:00
<PHP>{OPERATORS} lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
parser, first try
2017-11-23 15:33:47 +00:00
parse namespace
2017-11-24 01:36:58 +00:00
<PHP>\{ pushState(PHP); lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
<PHP>\} popState(); lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>\${VAR_NAME} lval.token = string(l.TokenBytes(nil)); return T_VARIABLE
<PHP>{VAR_NAME} if c == -1 {fmt.Printf("%q\n", string(l.TokenBytes(nil)))};lval.token = string(l.TokenBytes(nil)); return T_STRING
<PHP>-> begin(PROPERTY);lval.token = string(l.TokenBytes(nil)); return T_OBJECT_OPERATOR;
<PROPERTY>[ \t\n\r]+ lval.token = string(l.TokenBytes(nil)); return T_WHITESPACE;
<PROPERTY>-> lval.token = string(l.TokenBytes(nil)); return T_OBJECT_OPERATOR;
<PROPERTY>{VAR_NAME} begin(PHP);lval.token = string(l.TokenBytes(nil)); return T_STRING;
common tokens
2017-11-16 10:53:21 +00:00
<PROPERTY>. l.ungetN(1);begin(PHP)
parser, first try
2017-11-23 15:33:47 +00:00
<PHP>[\']([^\\\']*([\\][\'])*)*[\'] lval.token = string(l.TokenBytes(nil)); return T_CONSTANT_ENCAPSED_STRING;
start heredoc
2017-11-16 14:50:55 +00:00
parse namespace
2017-11-24 01:36:58 +00:00
<PHP>` begin(BACKQUOTE); lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
<BACKQUOTE>` begin(PHP); lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
handle backquote statements
2017-11-20 10:33:18 +00:00
start heredoc
2017-11-16 14:50:55 +00:00
<PHP>[b]?\<\<\<[ \t]*({VAR_NAME}|([']{VAR_NAME}['])|(["]{VAR_NAME}["])){NEW_LINE}
tb := l.TokenBytes(nil)
base heredoc handler
2017-11-16 17:00:34 +00:00
binPrefix := 0
if tb[0] == 'b' {
binPrefix = 1
}
lblFirst := 3 + binPrefix
lblLast := len(tb)-2
if tb[lblLast] == '\r' {
lblLast--
}
for {
if tb[lblFirst] == ' ' || tb[lblFirst] == '\t' {
lblFirst++
continue
}
break
}
switch tb[lblFirst] {
case '\'' :
lblFirst++
lblLast--
nodoc
2017-11-16 17:58:46 +00:00
begin(NOWDOC)
base heredoc handler
2017-11-16 17:00:34 +00:00
case '"' :
lblFirst++
lblLast--
handle heredoc statements
2017-11-20 10:22:03 +00:00
begin(HEREDOC)
base heredoc handler
2017-11-16 17:00:34 +00:00
default:
handle heredoc statements
2017-11-20 10:22:03 +00:00
begin(HEREDOC)
base heredoc handler
2017-11-16 17:00:34 +00:00
}
handle heredoc statements
2017-11-20 10:22:03 +00:00
heredocLabel = make([]byte, lblLast - lblFirst + 1)
copy(heredocLabel, tb[lblFirst:lblLast+1])
base heredoc handler
2017-11-16 17:00:34 +00:00
ungetCnt := len(heredocLabel)
searchLabelAhead := []byte{}
for i := 0; i < len(heredocLabel); i++ {
if c == -1 {
break;
}
searchLabelAhead = append(searchLabelAhead, byte(rune(c)))
c = l.Next()
}
if bytes.Equal(heredocLabel, searchLabelAhead) && ';' == rune(c) {
ungetCnt++
c = l.Next()
if '\n' == rune(c) || '\r' == rune(c) {
begin(HEREDOC_END)
}
}
l.ungetN(ungetCnt)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb); return T_START_HEREDOC
base heredoc handler
2017-11-16 17:00:34 +00:00
nodoc
2017-11-16 17:58:46 +00:00
<NOWDOC>.
searchLabel := []byte{}
tb := []byte{}
for {
if c == -1 {
break;
}
if '\n' == rune(c) || '\r' == rune(c) {
if bytes.Equal(append(heredocLabel, ';'), searchLabel) {
begin(HEREDOC_END)
tb = l.ungetN(len(heredocLabel)+1)
break;
}
searchLabel = []byte{}
} else {
searchLabel = append(searchLabel, byte(rune(c)))
}
c = l.Next()
}
handle heredoc statements
2017-11-20 10:22:03 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb); return T_ENCAPSED_AND_WHITESPACE
nodoc
2017-11-16 17:58:46 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<HEREDOC_END>{VAR_NAME}\; begin(PHP);lval.token = string(l.ungetN(1)); return T_END_HEREDOC
start heredoc
2017-11-16 14:50:55 +00:00
manual lex constant string
2017-11-13 21:55:09 +00:00
<PHP>[b]?[\"]
binPrefix := l.TokenBytes(nil)[0] == 'b'
small fix
2017-11-15 17:47:09 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
beginString := func() int {
small fix
2017-11-15 17:47:09 +00:00
cnt := 1; if (binPrefix) {cnt = 2}
l.ungetN(len(l.TokenBytes(nil))-cnt)
tokenBytes := l.TokenBytes(nil)[:cnt]
fmt.Println(string(tokenBytes)) // TODO: RETURN TOKEN
full lex double quoted strings
2017-11-15 22:05:44 +00:00
pushState(STRING)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tokenBytes); return rune2Class('"')
small fix
2017-11-15 17:47:09 +00:00
}
manual lex constant string
2017-11-13 21:55:09 +00:00
F:for {
if c == -1 {
break;
}
switch c {
case '"' :
c = l.Next();
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_CONSTANT_ENCAPSED_STRING
manual lex constant string
2017-11-13 21:55:09 +00:00
break F;
small fix
2017-11-15 17:47:09 +00:00
manual lex constant string
2017-11-13 21:55:09 +00:00
case '$':
c = l.Next();
if rune(c) == '{' || c >= 'A' && c <= 'Z' || c == '_' || c >= 'a' && c <= 'z' || c >= '\u007f' && c <= 'ÿ' {
parser, first try
2017-11-23 15:33:47 +00:00
return beginString()
manual lex constant string
2017-11-13 21:55:09 +00:00
break F;
small fix
2017-11-15 17:47:09 +00:00
}
l.ungetN(0)
manual lex constant string
2017-11-13 21:55:09 +00:00
case '{':
c = l.Next();
if rune(c) == '$' {
parser, first try
2017-11-23 15:33:47 +00:00
return beginString()
manual lex constant string
2017-11-13 21:55:09 +00:00
break F;
small fix
2017-11-15 17:47:09 +00:00
}
l.ungetN(0)
manual lex constant string
2017-11-13 21:55:09 +00:00
case '\\':
c = l.Next();
}
full lex double quoted strings
2017-11-15 22:05:44 +00:00
c = l.Next()
}
first commit
2017-11-07 06:21:38 +00:00
parse namespace
2017-11-24 01:36:58 +00:00
<STRING>\" popState(); lval.token = "\""; return rune2Class(l.Prev.Rune)
parser, first try
2017-11-23 15:33:47 +00:00
<STRING,HEREDOC,BACKQUOTE>\{\$ lval.token = string(l.ungetN(1)); return T_CURLY_OPEN
<STRING,HEREDOC,BACKQUOTE>\$\{ pushState(STRING_VAR_NAME);lval.token = string(l.TokenBytes(nil)); return T_DOLLAR_OPEN_CURLY_BRACES
handle backquote statements
2017-11-20 10:33:18 +00:00
<STRING,HEREDOC,BACKQUOTE>\$ l.ungetN(1);pushState(STRING_VAR)
full lex double quoted strings
2017-11-15 22:05:44 +00:00
<STRING>.
F1:for {
if c == -1 {
break;
}
lex string template
2017-11-12 11:13:31 +00:00
full lex double quoted strings
2017-11-15 22:05:44 +00:00
switch c {
case '"' :
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_ENCAPSED_AND_WHITESPACE
full lex double quoted strings
2017-11-15 22:05:44 +00:00
break F1;
case '$':
c = l.Next();
if rune(c) == '{' || c >= 'A' && c <= 'Z' || c == '_' || c >= 'a' && c <= 'z' || c >= '\u007f' && c <= 'ÿ' {
l.ungetN(1)
tb := l.TokenBytes(nil)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb[:len(tb)-1]); return T_ENCAPSED_AND_WHITESPACE
full lex double quoted strings
2017-11-15 22:05:44 +00:00
break F1;
}
l.ungetN(0)
case '{':
c = l.Next();
if rune(c) == '$' {
l.ungetN(1)
tb := l.TokenBytes(nil)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb[:len(tb)-1]); return T_ENCAPSED_AND_WHITESPACE
full lex double quoted strings
2017-11-15 22:05:44 +00:00
break F1;
}
l.ungetN(0)
case '\\':
handle backquote statements
2017-11-20 10:33:18 +00:00
c = l.Next();
}
c = l.Next()
}
<BACKQUOTE>.
F2:for {
if c == -1 {
break;
}
switch c {
case '`' :
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(l.TokenBytes(nil)); return T_ENCAPSED_AND_WHITESPACE
handle backquote statements
2017-11-20 10:33:18 +00:00
break F2;
case '$':
c = l.Next();
if rune(c) == '{' || c >= 'A' && c <= 'Z' || c == '_' || c >= 'a' && c <= 'z' || c >= '\u007f' && c <= 'ÿ' {
l.ungetN(1)
tb := l.TokenBytes(nil)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb[:len(tb)-1]); return T_ENCAPSED_AND_WHITESPACE
handle backquote statements
2017-11-20 10:33:18 +00:00
break F2;
}
l.ungetN(0)
case '{':
c = l.Next();
if rune(c) == '$' {
l.ungetN(1)
tb := l.TokenBytes(nil)
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb[:len(tb)-1]); return T_ENCAPSED_AND_WHITESPACE
handle backquote statements
2017-11-20 10:33:18 +00:00
break F2;
}
l.ungetN(0)
case '\\':
full lex double quoted strings
2017-11-15 22:05:44 +00:00
c = l.Next();
}
c = l.Next()
}
first commit
2017-11-07 06:21:38 +00:00
handle heredoc statements
2017-11-20 10:22:03 +00:00
<HEREDOC>.|[ \t\n\r]
searchLabel := []byte{}
tb := []byte{}
HEREDOCFOR:for {
if c == -1 {
break;
}
switch c {
case '\n': fallthrough
case '\r':
add tokens
2017-11-22 10:03:12 +00:00
if bytes.Equal(append(heredocLabel, ';'), searchLabel) { // TODO handle ';' as optional
handle heredoc statements
2017-11-20 10:22:03 +00:00
begin(HEREDOC_END)
tb = l.ungetN(len(heredocLabel)+1)
break HEREDOCFOR;
}
searchLabel = []byte{}
case '$':
c = l.Next();
if rune(c) == '{' || c >= 'A' && c <= 'Z' || c == '_' || c >= 'a' && c <= 'z' || c >= '\u007f' && c <= 'ÿ' {
tb = l.ungetN(1)
break HEREDOCFOR;
}
l.ungetN(0)
searchLabel = []byte{}
case '{':
c = l.Next();
if rune(c) == '$' {
tb = l.ungetN(1)
break HEREDOCFOR;
}
l.ungetN(0)
searchLabel = []byte{}
case '\\':
c = l.Next();
searchLabel = []byte{}
default:
searchLabel = append(searchLabel, byte(rune(c)))
}
c = l.Next()
}
parser, first try
2017-11-23 15:33:47 +00:00
lval.token = string(tb); return T_ENCAPSED_AND_WHITESPACE
handle heredoc statements
2017-11-20 10:22:03 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<STRING_VAR>\${VAR_NAME} lval.token = string(l.TokenBytes(nil)); return T_VARIABLE
<STRING_VAR>->{VAR_NAME} lval.token = string(l.ungetN(len(l.TokenBytes(nil))-2)); return T_OBJECT_OPERATOR
<STRING_VAR>{VAR_NAME} popState();lval.token = string(l.TokenBytes(nil)); return T_STRING
parse namespace
2017-11-24 01:36:58 +00:00
<STRING_VAR>\[ pushState(STRING_VAR_INDEX);lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
handle heredoc statements
2017-11-20 10:22:03 +00:00
<STRING_VAR>.|[ \t\n\r] l.ungetN(1);popState()
tmp
2017-11-13 07:48:57 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<STRING_VAR_INDEX>{LNUM}|{HNUM}|{BNUM} lval.token = string(l.TokenBytes(nil)); return T_NUM_STRING
<STRING_VAR_INDEX>\${VAR_NAME} lval.token = string(l.TokenBytes(nil)); return T_VARIABLE
<STRING_VAR_INDEX>{VAR_NAME} lval.token = string(l.TokenBytes(nil)); return T_STRING
parse namespace
2017-11-24 01:36:58 +00:00
<STRING_VAR_INDEX>\] popState(); popState();lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
parser, first try
2017-11-23 15:33:47 +00:00
<STRING_VAR_INDEX>[ \n\r\t\\'#] popState(); popState();lval.token = string(l.TokenBytes(nil)); return T_ENCAPSED_AND_WHITESPACE
parse namespace
2017-11-24 01:36:58 +00:00
<STRING_VAR_INDEX>{OPERATORS} lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
<STRING_VAR_INDEX>. lval.token = string(l.TokenBytes(nil)); return rune2Class(l.Prev.Rune)
tmp
2017-11-13 07:48:57 +00:00
parser, first try
2017-11-23 15:33:47 +00:00
<STRING_VAR_NAME>{VAR_NAME}[\[\}] popState();pushState(PHP);lval.token = string(l.ungetN(1)); return T_STRING_VARNAME
full lex double quoted strings
2017-11-15 22:05:44 +00:00
<STRING_VAR_NAME>. l.ungetN(1);popState();pushState(PHP)
first commit
2017-11-07 06:21:38 +00:00
%%
if c, ok := l.Abort(); ok { return int(c) }
goto yyAction
}
Reference in New Issue Copy Permalink