* harbour/common.mak
* updated for new files - please check
* harbour/harbour.spec
* added compiler library
* harbour/bin/pack_src.sh
* harbour/bin/hb-func.sh
* updated for new files and libraries
* harbour/config/w32/mingw32.cf
* harbour/config/w32/watcom.cf
* harbour/config/w32/xcc.cf
* added winsock libraries
* harbour/include/hbapicdp.h
* harbour/source/rtl/cdpapi.c
+ added hb_cdpicmp() - not case sensitive version of hb_cdpcmp()
* harbour/include/hbapiitm.h
* harbour/source/vm/itemapi.c
+ hb_itemStrICmp(), hb_itemCopyFromRef(), hb_itemMoveFromRef()
* harbour/include/hbapi.h
* harbour/include/hbcomp.h
* harbour/include/hbcompdf.h
* harbour/include/hbexpra.c
* harbour/include/hbexprb.c
* harbour/include/hbexprop.h
* harbour/include/hbmacro.h
* harbour/include/hbpcode.h
* harbour/include/hbvmpub.h
* harbour/include/hbxvm.h
* harbour/source/common/expropt1.c
* harbour/source/compiler/complex.c
* harbour/source/compiler/genc.c
* harbour/source/compiler/gencc.c
* harbour/source/compiler/gencli.c
* harbour/source/compiler/genhrb.c
* harbour/source/compiler/genobj32.c
* harbour/source/compiler/harbour.y
* harbour/source/compiler/harbour.yyc
* harbour/source/compiler/harbour.yyh
* harbour/source/compiler/hbdead.c
* harbour/source/compiler/hbfix.c
* harbour/source/compiler/hblbl.c
* harbour/source/compiler/hbmain.c
* harbour/source/compiler/hbopt.c
* harbour/source/compiler/hbpcode.c
* harbour/source/compiler/hbstripl.c
* harbour/source/macro/macro.y
* harbour/source/macro/macro.yyc
* harbour/source/macro/macro.yyh
* harbour/source/macro/macrolex.c
* harbour/source/vm/Makefile
* harbour/source/vm/arrays.c
* harbour/source/vm/asort.c
* harbour/source/vm/classes.c
* harbour/source/vm/eval.c
* harbour/source/vm/garbage.c
* harbour/source/vm/hvm.c
* harbour/source/vm/itemapi.c
* harbour/source/vm/macro.c
+ harbour/source/vm/hashes.c
+ harbour/source/vm/hashfunc.c
+ added hash items, f.e.:
local h1 := {=>}, h2 := { "a"=>1.234, "b"=>2.345 }
? h2[ "a" ], h2[ "b ]
+ added support for DYNAMIC function declaration - it allow to define
functions which are lately bound at runtime, f.e.:
/*** t01.prg ***/
dynamic func1
proc main()
local h:=__hrbload("t02.hrb")
? func1()
return
/*** t02.prg ***/
func func1
return "Hello!!!"
% use new FUNCALL structure to hold EXTERNAL and DYNAMIC functions,
it reduce memory usage, FUNCALL is much smaller then FUNCTION
% use symbol scope bits when possible instead of making some linear scan
+ added new enumarator message: __ENUMKEY - it allow to access
key value when hash item is base enumerator value, f.e.:
proc main()
local v, h:={"a"=>1.000,"b"=>2.000,"c"=>3.000}
heval( h, { |k,v,i| qout( k, v, i ) } ); ?
for each v in h
? v, "=>", v:__enumKey(), v:__enumValue(), v:__enumIndex(), ;
valtype(v:__enumBase())
v += 0.123
next
? ;heval( h, { |k,v,i| qout( k, v, i ) } )
return
+ added C level hb_hash*() functions
+ added support for full HASH item cloning and updated array cloning
to also clone nested hashes - please note that xHarbour does not do
that, in xHarbour ACLONE() clones _ONLY_ nested arrays and HCLONE()
_DOES_NOT_ clone _ANY_ nested items.
* harbour/include/hbextern.ch
+ added hash functions HB_H*()
* changed INET*() functions to HB_INET*()
+ added hash functions H*() and socket functions INET*() when
HB_COMPAT_XHB is set
* harbour/include/hbtypes.h
+ added missing HB_EXTERN_BEGIN / HB_EXTERN_END
* harbour/include/hbpp.h
* harbour/source/pp/ppcore.c
! added protection against automatic word concatenation in some cases
! fixed preprocessing expressions when match marker matches ';' token
* harbour/source/rtl/Makefile
+ harbour/source/rtl/itemseri.c
+ added functions for item serialization: HB_SERIALIZE() and
HB_DESERIALIZE() - these function are not binary compatible
with xHarbour functions with the same names but make very
similar job with the exception to serialization of codeblock
and object variables - Harbour does not allow to serialize
codeblocks and serialize objects as arrays.
In most cases these functions can replace the xHarbour ones
+ added HB_DESERIALBEGIN() and HB_DESERIALIZE() functions covered
by HB_COMPAT_XHB macro - this functions are only for compatibility
with existing xHarbour code, In Harbour HB_DESERIALBEGIN() is
dummy function which returns first parameter and HB_DESERIALNEXT()
is a simple wrapper to HB_DESERIALIZE() so it's not necessary to
use them.
* harbour/source/rtl/hbinet.c
* changed INET*() functions to HB_INET*() and enable them for default
build
+ added INET*() functions wrappers covered by HB_COMPAT_XHB macro
* harbour/source/rtl/hbrandom.c
+ added HB_RANDOMINT() - xHarbour compatible
* harbour/source/rtl/len.c
+ added support for HASHes
* harbour/source/rtl/valtype.c
+ added support for HASHes
+ added set of HB_IS*() functions - they are a little bit faster then
calling VALTYPE( v ) == <cVal>
- removed HB_ISBYREF() - this function cannot longer work, it was using
a Clipper incompatible anomalies in passing variables by reference I
fixed so it has to stop to work. If it will be realy necessary to
implement HB_ISBYREF() function then please inform me - it will have
to be done at compiler level or with some much deeper HVM stack
checking.
* harbour/source/vm/extend.c
! fixed hb_extIsArray() and hb_extIsObject() to work well with
parameters passed by reference.
Please note that now hb_extIsArray() return TRUE only for pure arrays
not object values.
* harbour/contrib/Makefile
+ harbour/contrib/tip/Changelog
+ harbour/contrib/tip/Makefile
+ harbour/contrib/tip/atokens.c
+ harbour/contrib/tip/base64x.c
+ harbour/contrib/tip/cgi.prg
+ harbour/contrib/tip/client.prg
+ harbour/contrib/tip/credent.prg
+ harbour/contrib/tip/cstr.prg
+ harbour/contrib/tip/encb64.prg
+ harbour/contrib/tip/encmthd.c
+ harbour/contrib/tip/encoder.prg
+ harbour/contrib/tip/encqp.prg
+ harbour/contrib/tip/encurl.prg
+ harbour/contrib/tip/ftpcln.prg
+ harbour/contrib/tip/hbhex2n.c
+ harbour/contrib/tip/httpcln.prg
+ harbour/contrib/tip/mail.prg
+ harbour/contrib/tip/popcln.prg
+ harbour/contrib/tip/smtpcln.prg
+ harbour/contrib/tip/tip.ch
+ harbour/contrib/tip/url.prg
+ harbour/contrib/tip/utils.c
+ added TIP library - code borrowed from xHarbour
Please test - a lot of above code is not well tested, also some peaces
were written over year ago for different things (f.e. serialization for
NETRDD) and now I collected them and committed.
The TIP library was not tested at all. It can be compiled but I cannot
say if it works - I hope that people familiar with it can make necessary
test and fixes.
It's also not the final version of low level HASH item code. I'm working
on more efficient structure which uses binary tries but I cannot say when
I'll finish it (maybe in this weekend or maybe in next year) so I committed
working version now even if I'm not happy with overall performance (BTW
not worser then in xHarbour)
676 lines
22 KiB
C
676 lines
22 KiB
C
/*
|
|
* $Id$
|
|
*/
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* small and MT safe lexer for macro compiler
|
|
*
|
|
* Copyright 2006 Przemyslaw Czerpak <druzus / at / priv.onet.pl>
|
|
* www - http://www.harbour-project.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, or (at your option)
|
|
* any later version.
|
|
*
|
|
* 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 software; see the file COPYING. If not, write to
|
|
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
|
|
* Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/).
|
|
*
|
|
* As a special exception, the Harbour Project gives permission for
|
|
* additional uses of the text contained in its release of Harbour.
|
|
*
|
|
* The exception is that, if you link the Harbour libraries with other
|
|
* files to produce an executable, this does not by itself cause the
|
|
* resulting executable to be covered by the GNU General Public License.
|
|
* Your use of that executable is in no way restricted on account of
|
|
* linking the Harbour library code into it.
|
|
*
|
|
* This exception does not however invalidate any other reasons why
|
|
* the executable file might be covered by the GNU General Public License.
|
|
*
|
|
* This exception applies only to the code released by the Harbour
|
|
* Project under the name Harbour. If you copy code from other
|
|
* Harbour Project or Free Software Foundation releases into a copy of
|
|
* Harbour, as the General Public License permits, the exception does
|
|
* not apply to the code that you add in this way. To avoid misleading
|
|
* anyone as to the status of such modified files, you must delete
|
|
* this exception notice from them.
|
|
*
|
|
* If you write modifications of your own for Harbour, it is your choice
|
|
* whether to permit this exception to apply to your modifications.
|
|
* If you do not wish that, delete this exception notice.
|
|
*
|
|
*/
|
|
|
|
#define HB_MACRO_SUPPORT
|
|
|
|
#include "hbmacro.h"
|
|
#include "hbcomp.h"
|
|
#include "hbdate.h"
|
|
#include "macroy.h"
|
|
|
|
#define HB_LEX_ISFIRSTIDCHAR(c) ( ( (c) >= 'A' && (c) <= 'Z' ) || \
|
|
( (c) >= 'a' && (c) <= 'z' ) || \
|
|
(c) == '_' )
|
|
#define HB_LEX_ISDIGIT(c) ( (c) >= '0' && (c) <= '9' )
|
|
#define HB_LEX_ISHEXDIGIT(c) ( ( (c) >= '0' && (c) <= '9' ) || \
|
|
( (c) >= 'A' && (c) <= 'F' ) || \
|
|
( (c) >= 'a' && (c) <= 'f' ) )
|
|
#define HB_LEX_ISNEXTIDCHAR(c) ( HB_LEX_ISFIRSTIDCHAR(c) || \
|
|
HB_LEX_ISDIGIT(c) )
|
|
|
|
typedef struct _HB_MACRO_LEX
|
|
{
|
|
char * pString;
|
|
char * pDst;
|
|
ULONG ulLen;
|
|
ULONG ulSrc;
|
|
BOOL quote;
|
|
char pBuffer[ 2 ];
|
|
}
|
|
HB_MACRO_LEX, * PHB_MACRO_LEX;
|
|
|
|
BOOL hb_macroLexNew( HB_MACRO_PTR pMacro )
|
|
{
|
|
if( pMacro->length )
|
|
{
|
|
/*
|
|
* the total maximum size for parsed tokens delimited with ASCII NUL
|
|
* cannot be bigger then the size of macro string because only
|
|
* identifiers, strings, macrovars and macrotexts have to be returned
|
|
* as string and all these tokens have to be separated by some non
|
|
* value tokens or strings which will have not used delimiters
|
|
*/
|
|
pMacro->pLex = hb_xgrab( sizeof( HB_MACRO_LEX ) + pMacro->length );
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->pString = pMacro->string;
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->ulLen = pMacro->length;
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->ulSrc = 0;
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->quote = TRUE;
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->pDst =
|
|
( ( PHB_MACRO_LEX ) pMacro->pLex )->pBuffer;
|
|
return TRUE;
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
void hb_macroLexDelete( HB_MACRO_PTR pMacro )
|
|
{
|
|
if( pMacro->pLex )
|
|
{
|
|
hb_xfree( pMacro->pLex );
|
|
pMacro->pLex = NULL;
|
|
}
|
|
}
|
|
|
|
static void hb_lexIdentCopy( PHB_MACRO_LEX pLex )
|
|
{
|
|
while( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
char ch = pLex->pString[ pLex->ulSrc ];
|
|
if( ch >= 'a' && ch <= 'z' )
|
|
*pLex->pDst++ = ch - ( 'a' - 'A' );
|
|
else if( ( ch >= 'A' && ch <= 'Z' ) ||
|
|
( ch >= '0' && ch <= '9' ) || ch == '_' )
|
|
*pLex->pDst++ = ch;
|
|
else
|
|
break;
|
|
pLex->ulSrc++;
|
|
}
|
|
}
|
|
|
|
static int hb_lexStringCopy( YYSTYPE *yylval_ptr, HB_MACRO_PTR pMacro,
|
|
PHB_MACRO_LEX pLex, char cDelim )
|
|
{
|
|
pLex->quote = FALSE;
|
|
yylval_ptr->valChar.string = pLex->pDst;
|
|
while( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
char ch = pLex->pString[ pLex->ulSrc++ ];
|
|
if( ch == cDelim )
|
|
{
|
|
yylval_ptr->valChar.length = pLex->pDst - yylval_ptr->valChar.string;
|
|
*pLex->pDst++ = '\0';
|
|
return LITERAL;
|
|
}
|
|
*pLex->pDst++ = ch;
|
|
}
|
|
yylval_ptr->valChar.length = pLex->pDst - yylval_ptr->valChar.string;
|
|
*pLex->pDst++ = '\0';
|
|
hb_macroError( EG_SYNTAX, pMacro );
|
|
return LITERAL;
|
|
}
|
|
|
|
static int hb_lexStringExtCopy( YYSTYPE *yylval_ptr, HB_MACRO_PTR pMacro,
|
|
PHB_MACRO_LEX pLex )
|
|
{
|
|
ULONG ulLen;
|
|
pLex->quote = FALSE;
|
|
yylval_ptr->valChar.string = pLex->pDst;
|
|
while( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
char ch = pLex->pString[ pLex->ulSrc++ ];
|
|
if( ch == '\\' )
|
|
{
|
|
if( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
*pLex->pDst++ = ch;
|
|
ch = pLex->pString[ pLex->ulSrc++ ];
|
|
}
|
|
}
|
|
else if( ch == '"' )
|
|
{
|
|
ulLen = pLex->pDst - yylval_ptr->valChar.string;
|
|
*pLex->pDst++ = '\0';
|
|
hb_strRemEscSeq( yylval_ptr->valChar.string, &ulLen );
|
|
yylval_ptr->valChar.length = ( int ) ulLen;
|
|
return LITERAL;
|
|
}
|
|
*pLex->pDst++ = ch;
|
|
}
|
|
ulLen = pLex->pDst - yylval_ptr->valChar.string;
|
|
*pLex->pDst++ = '\0';
|
|
hb_strRemEscSeq( yylval_ptr->valChar.string, &ulLen );
|
|
yylval_ptr->valChar.length = ( int ) ulLen;
|
|
hb_macroError( EG_SYNTAX, pMacro );
|
|
return LITERAL;
|
|
}
|
|
|
|
static int hb_lexNumConv( YYSTYPE *yylval_ptr, PHB_MACRO_LEX pLex, ULONG ulLen )
|
|
{
|
|
HB_LONG lNumber;
|
|
double dNumber;
|
|
int iDec, iWidth;
|
|
|
|
if( hb_compStrToNum( pLex->pString + pLex->ulSrc, ulLen,
|
|
&lNumber, &dNumber, &iDec, &iWidth ) )
|
|
{
|
|
yylval_ptr->valDouble.dNumber = dNumber;
|
|
yylval_ptr->valDouble.bDec = iDec;
|
|
yylval_ptr->valDouble.bWidth = iWidth;
|
|
pLex->ulSrc += ulLen;
|
|
return NUM_DOUBLE;
|
|
}
|
|
else
|
|
{
|
|
yylval_ptr->valLong.lNumber = lNumber;
|
|
yylval_ptr->valLong.bWidth = iWidth;
|
|
pLex->ulSrc += ulLen;
|
|
return NUM_LONG;
|
|
}
|
|
}
|
|
|
|
int hb_macrolex( YYSTYPE *yylval_ptr, HB_MACRO_PTR pMacro )
|
|
{
|
|
PHB_MACRO_LEX pLex = ( PHB_MACRO_LEX ) pMacro->pLex;
|
|
|
|
while( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
char ch = pLex->pString[ pLex->ulSrc++ ];
|
|
switch( ch )
|
|
{
|
|
case ' ':
|
|
case '\t':
|
|
case '\r':
|
|
break;
|
|
|
|
case '$':
|
|
case ',':
|
|
case '|':
|
|
case '@':
|
|
case '(':
|
|
case '{':
|
|
case ';':
|
|
case '\n':
|
|
pLex->quote = TRUE;
|
|
return ch;
|
|
|
|
case ')':
|
|
case '}':
|
|
case ']':
|
|
pLex->quote = FALSE;
|
|
return ch;
|
|
|
|
case '#':
|
|
pLex->quote = TRUE;
|
|
return NE1;
|
|
|
|
case '!':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return NE2;
|
|
}
|
|
return NOT;
|
|
|
|
case '<':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '>' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return NE2;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return LE;
|
|
}
|
|
return '<';
|
|
|
|
case '>':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return GE;
|
|
}
|
|
return '>';
|
|
|
|
case '=':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return EQ;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '>' && HB_SUPPORT_HARBOUR )
|
|
{
|
|
pLex->ulSrc++;
|
|
return HASHOP;
|
|
}
|
|
return '=';
|
|
|
|
case '+':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '+' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return INC;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return PLUSEQ;
|
|
}
|
|
return '+';
|
|
|
|
case '-':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '-' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return DEC;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return MINUSEQ;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '>' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return ALIASOP;
|
|
}
|
|
return '-';
|
|
|
|
case '*':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '*' )
|
|
{
|
|
pLex->ulSrc++;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return EXPEQ;
|
|
}
|
|
return POWER;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return MULTEQ;
|
|
}
|
|
return '*';
|
|
|
|
case '/':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return DIVEQ;
|
|
}
|
|
return '/';
|
|
|
|
case '%':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return MODEQ;
|
|
}
|
|
return '%';
|
|
|
|
case '^':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return EXPEQ;
|
|
}
|
|
return POWER;
|
|
|
|
case ':':
|
|
pLex->quote = TRUE;
|
|
if( pLex->pString[ pLex->ulSrc ] == '=' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return INASSIGN;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == ':' )
|
|
{
|
|
yylval_ptr->string = "SELF";
|
|
return IDENTIFIER;
|
|
}
|
|
return ':';
|
|
|
|
case '.':
|
|
pLex->quote = TRUE;
|
|
if( pLex->ulSrc < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ pLex->ulSrc ] ) )
|
|
{
|
|
ULONG ul = pLex->ulSrc;
|
|
while( ++ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) );
|
|
ul -= --pLex->ulSrc;
|
|
return hb_lexNumConv( yylval_ptr, pLex, ul );
|
|
}
|
|
if( pLex->ulLen - pLex->ulSrc >= 4 &&
|
|
pLex->pString[ pLex->ulSrc + 3 ] == '.' )
|
|
{
|
|
if( ( pLex->pString[ pLex->ulSrc + 0 ] | ('a' - 'A') ) == 'a' &&
|
|
( pLex->pString[ pLex->ulSrc + 1 ] | ('a' - 'A') ) == 'n' &&
|
|
( pLex->pString[ pLex->ulSrc + 2 ] | ('a' - 'A') ) == 'd' )
|
|
{
|
|
pLex->ulSrc += 4;
|
|
return AND;
|
|
}
|
|
if( ( pLex->pString[ pLex->ulSrc + 0 ] | ('a' - 'A') ) == 'n' &&
|
|
( pLex->pString[ pLex->ulSrc + 1 ] | ('a' - 'A') ) == 'o' &&
|
|
( pLex->pString[ pLex->ulSrc + 2 ] | ('a' - 'A') ) == 't' )
|
|
{
|
|
pLex->ulSrc += 4;
|
|
return NOT;
|
|
}
|
|
}
|
|
if( pLex->ulLen - pLex->ulSrc >= 3 &&
|
|
pLex->pString[ pLex->ulSrc + 2 ] == '.' )
|
|
{
|
|
if( ( pLex->pString[ pLex->ulSrc + 0 ] | ('a' - 'A') ) == 'o' &&
|
|
( pLex->pString[ pLex->ulSrc + 1 ] | ('a' - 'A') ) == 'r' )
|
|
{
|
|
pLex->ulSrc += 3;
|
|
return OR;
|
|
}
|
|
}
|
|
if( pLex->ulLen - pLex->ulSrc >= 2 &&
|
|
pLex->pString[ pLex->ulSrc + 1 ] == '.' )
|
|
{
|
|
if( ( pLex->pString[ pLex->ulSrc ] | ('a' - 'A') ) == 't' ||
|
|
( pLex->pString[ pLex->ulSrc ] | ('a' - 'A') ) == 'y' )
|
|
{
|
|
pLex->quote = FALSE;
|
|
pLex->ulSrc += 2;
|
|
return TRUEVALUE;
|
|
}
|
|
if( ( pLex->pString[ pLex->ulSrc ] | ('a' - 'A') ) == 'f' ||
|
|
( pLex->pString[ pLex->ulSrc ] | ('a' - 'A') ) == 'n' )
|
|
{
|
|
pLex->quote = FALSE;
|
|
pLex->ulSrc += 2;
|
|
return FALSEVALUE;
|
|
}
|
|
if( pLex->pString[ pLex->ulSrc ] == '.' )
|
|
{
|
|
pLex->ulSrc += 2;
|
|
return EPSILON;
|
|
}
|
|
}
|
|
return '.';
|
|
|
|
case '[':
|
|
if( pLex->quote )
|
|
return hb_lexStringCopy( yylval_ptr, pMacro, pLex, ']' );
|
|
pLex->quote = TRUE;
|
|
return '[';
|
|
|
|
case '`':
|
|
case '\'':
|
|
return hb_lexStringCopy( yylval_ptr, pMacro, pLex, '\'' );
|
|
|
|
case '"':
|
|
return hb_lexStringCopy( yylval_ptr, pMacro, pLex, '"' );
|
|
|
|
case '&':
|
|
if( pLex->ulSrc < pLex->ulLen )
|
|
{
|
|
if( HB_LEX_ISFIRSTIDCHAR( pLex->pString[ pLex->ulSrc ] ) )
|
|
{
|
|
/* [&<keyword>[.[<nextidchars>]]]+ */
|
|
int iParts = 0;
|
|
pLex->quote = FALSE;
|
|
yylval_ptr->string = pLex->pDst;
|
|
pLex->ulSrc--;
|
|
do
|
|
{
|
|
++iParts;
|
|
*pLex->pDst++ = '&';
|
|
pLex->ulSrc++;
|
|
hb_lexIdentCopy( pLex );
|
|
if( pLex->pString[ pLex->ulSrc ] == '.' )
|
|
{
|
|
++iParts;
|
|
*pLex->pDst++ = '.';
|
|
pLex->ulSrc++;
|
|
hb_lexIdentCopy( pLex );
|
|
}
|
|
}
|
|
while( pLex->ulLen - pLex->ulSrc > 1 &&
|
|
pLex->pString[ pLex->ulSrc ] == '&' &&
|
|
HB_LEX_ISFIRSTIDCHAR( pLex->pString[ pLex->ulSrc + 1 ] ) );
|
|
if( iParts == 2 && *( pLex->pDst - 1 ) == '.' )
|
|
{
|
|
pLex->pDst--;
|
|
iParts = 1;
|
|
}
|
|
*pLex->pDst++ = '\0';
|
|
if( iParts == 1 )
|
|
{
|
|
yylval_ptr->string++;
|
|
return MACROVAR;
|
|
}
|
|
return MACROTEXT;
|
|
}
|
|
else if( pLex->pString[ pLex->ulSrc ] == '\'' ||
|
|
pLex->pString[ pLex->ulSrc ] == '"' ||
|
|
pLex->pString[ pLex->ulSrc ] == '[' )
|
|
hb_macroError( EG_SYNTAX, pMacro );
|
|
}
|
|
pLex->quote = TRUE;
|
|
return '&';
|
|
|
|
default:
|
|
if( HB_LEX_ISDIGIT( ch ) )
|
|
{
|
|
ULONG ul = pLex->ulSrc;
|
|
|
|
pLex->quote = FALSE;
|
|
if( ch == '0' && ul < pLex->ulLen )
|
|
{
|
|
if( pLex->pString[ ul ] == 'd' || pLex->pString[ ul ] == 'D' )
|
|
{
|
|
while( ++ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) );
|
|
if( ul - pLex->ulSrc == 9 )
|
|
{
|
|
int year, month, day;
|
|
hb_dateStrGet( pLex->pString + pLex->ulSrc + 1,
|
|
&year, &month, &day );
|
|
yylval_ptr->valLong.lNumber =
|
|
hb_dateEncode( year, month, day );
|
|
pLex->ulSrc = ul;
|
|
return NUM_DATE;
|
|
}
|
|
ul = pLex->ulSrc;
|
|
}
|
|
else if( pLex->pString[ ul ] == 'x' ||
|
|
pLex->pString[ ul ] == 'X' )
|
|
{
|
|
while( ++ul < pLex->ulLen &&
|
|
HB_LEX_ISHEXDIGIT( pLex->pString[ ul ] ) );
|
|
if( ul == pLex->ulSrc + 1 )
|
|
--ul;
|
|
}
|
|
else
|
|
{
|
|
while( ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) )
|
|
++ul;
|
|
if( pLex->ulLen - ul > 1 && pLex->pString[ ul ] == '.' &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul + 1 ] ) )
|
|
{
|
|
while( ++ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) );
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
while( ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) )
|
|
++ul;
|
|
if( pLex->ulLen - ul > 1 && pLex->pString[ ul ] == '.' &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul + 1 ] ) )
|
|
{
|
|
while( ++ul < pLex->ulLen &&
|
|
HB_LEX_ISDIGIT( pLex->pString[ ul ] ) );
|
|
}
|
|
}
|
|
ul -= --pLex->ulSrc;
|
|
return hb_lexNumConv( yylval_ptr, pLex, ul );
|
|
}
|
|
else if( HB_LEX_ISFIRSTIDCHAR( ch ) )
|
|
{
|
|
pLex->quote = FALSE;
|
|
yylval_ptr->string = pLex->pDst;
|
|
*pLex->pDst++ = ch - ( ( ch >= 'a' && ch <= 'z' ) ? 'a' - 'A' : 0 );
|
|
hb_lexIdentCopy( pLex );
|
|
if( pLex->ulLen - pLex->ulSrc > 1 &&
|
|
pLex->pString[ pLex->ulSrc ] == '&' &&
|
|
HB_LEX_ISFIRSTIDCHAR( pLex->pString[ pLex->ulSrc + 1 ] ) )
|
|
{
|
|
/* [<keyword>][&<keyword>[.[<nextidchars>]]]+ */
|
|
do
|
|
{
|
|
*pLex->pDst++ = '&';
|
|
pLex->ulSrc++;
|
|
hb_lexIdentCopy( pLex );
|
|
if( pLex->pString[ pLex->ulSrc ] == '.' )
|
|
{
|
|
*pLex->pDst++ = '.';
|
|
pLex->ulSrc++;
|
|
hb_lexIdentCopy( pLex );
|
|
}
|
|
}
|
|
while( pLex->ulLen - pLex->ulSrc > 1 &&
|
|
pLex->pString[ pLex->ulSrc ] == '&' &&
|
|
HB_LEX_ISFIRSTIDCHAR( pLex->pString[ pLex->ulSrc + 1 ] ) );
|
|
*pLex->pDst++ = '\0';
|
|
return MACROTEXT;
|
|
}
|
|
*pLex->pDst++ = '\0';
|
|
if( pLex->pDst - yylval_ptr->string == 2 )
|
|
{
|
|
if( yylval_ptr->string[ 0 ] == 'E' &&
|
|
pLex->ulLen > pLex->ulSrc &&
|
|
pLex->pString[ pLex->ulSrc ] == '"' )
|
|
{
|
|
pLex->ulSrc++;
|
|
return hb_lexStringExtCopy( yylval_ptr, pMacro, pLex );
|
|
}
|
|
}
|
|
else if( pLex->pDst - yylval_ptr->string == 3 )
|
|
{
|
|
if( yylval_ptr->string[ 0 ] == 'I' &&
|
|
yylval_ptr->string[ 1 ] == 'F' )
|
|
return IIF;
|
|
}
|
|
else if( pLex->pDst - yylval_ptr->string == 4 )
|
|
{
|
|
if( yylval_ptr->string[ 0 ] == 'I' &&
|
|
yylval_ptr->string[ 1 ] == 'I' &&
|
|
yylval_ptr->string[ 2 ] == 'F' )
|
|
return IIF;
|
|
else if( yylval_ptr->string[ 0 ] == 'N' &&
|
|
yylval_ptr->string[ 1 ] == 'I' &&
|
|
yylval_ptr->string[ 2 ] == 'L' )
|
|
return NIL;
|
|
}
|
|
else if( pLex->pDst - yylval_ptr->string > 4 )
|
|
{
|
|
if( yylval_ptr->string[ 0 ] == '_' )
|
|
{
|
|
if( memcmp( "FIELD", yylval_ptr->string + 1,
|
|
pLex->pDst - yylval_ptr->string - 2 ) == 0 )
|
|
return FIELD;
|
|
}
|
|
else if( yylval_ptr->string[ 0 ] == 'F' )
|
|
{
|
|
if( memcmp( "IELD", yylval_ptr->string + 1,
|
|
pLex->pDst - yylval_ptr->string - 2 ) == 0 )
|
|
return FIELD;
|
|
}
|
|
else if( pLex->pDst - yylval_ptr->string == 6 &&
|
|
yylval_ptr->string[ 0 ] == 'Q' &&
|
|
memcmp( "SELF", yylval_ptr->string + 1,
|
|
pLex->pDst - yylval_ptr->string - 2 ) == 0 )
|
|
{
|
|
while( pLex->ulSrc < pLex->ulLen &&
|
|
( pLex->pString[ pLex->ulSrc ] == ' ' ||
|
|
pLex->pString[ pLex->ulSrc ] == '\t' ) )
|
|
pLex->ulSrc++;
|
|
if( pLex->ulSrc < pLex->ulLen &&
|
|
pLex->pString[ pLex->ulSrc ] == '(' )
|
|
{
|
|
ULONG ul = pLex->ulSrc;
|
|
while( ++ul < pLex->ulLen )
|
|
{
|
|
if( pLex->pString[ ul ] == ')' )
|
|
{
|
|
pLex->ulSrc = ul + 1;
|
|
return SELF;
|
|
}
|
|
else if( pLex->pString[ ul ] != ' ' &&
|
|
pLex->pString[ ul ] != '\t' )
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return IDENTIFIER;
|
|
}
|
|
return ch;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|