3240593d2e
Исправлена ошибка for step Дополнена справка по for step и foreach index J,yjdkty ntrcnjdsq htlfrnjh? gjlcdtxbdf.obq ыеуз b штвуч rjyntrcnyj d hfvrf[ jlyjq cnhjrb
585 lines
18 KiB
Plaintext
585 lines
18 KiB
Plaintext
%{
|
||
public PT parsertools;
|
||
Stack<BufferContext> buffStack = new Stack<BufferContext>();
|
||
Stack<string> fNameStack = new Stack<string>();
|
||
Stack<int> IfStack = new Stack<int>(); // 0 - if, 1 - else
|
||
public List<string> Defines = new List<string>();
|
||
int IfExclude;
|
||
string Pars;
|
||
string directivename;
|
||
string directiveparam;
|
||
LexLocation currentLexLocation;
|
||
%}
|
||
|
||
%namespace GPPGParserScanner
|
||
|
||
%using PascalABCSavParser;
|
||
%using PascalABCCompiler.SyntaxTree;
|
||
%using PascalABCCompiler.ParserTools;
|
||
%using QUT.Gppg;
|
||
|
||
Letter [[:IsLetter:]_]
|
||
Digit [0-9]
|
||
LetterDigit {Letter}|{Digit}
|
||
ID {Letter}{LetterDigit}*
|
||
HexDigit {Digit}|[abcdefABCDEF]
|
||
DotChr [^\r\n]
|
||
OneLineCmnt \/\/{DotChr}*
|
||
|
||
DotChr1 [^\r\n}]
|
||
|
||
NOTASCII [^\x00-x7F]
|
||
|
||
CHARACTERNUM '[^'\n]'
|
||
INTNUM {Digit}+
|
||
BIGINTNUM {INTNUM}[bB][iI]
|
||
FLOATNUM {INTNUM}\.{INTNUM}
|
||
EXPNUM ({INTNUM}\.)?{INTNUM}[eE][+\-]?{INTNUM}
|
||
STRINGNUM \'([^\'\n]|\'\')*\'
|
||
FORMATSTRINGNUM \$\'([^\'\n]|\'\')*\'
|
||
HEXNUM ${HexDigit}+
|
||
SHARPCHARNUM #{Digit}+
|
||
OLDDIRECTIVE #{ID}
|
||
IFDEF \{\$ifdef\ {DotChr1}*\}
|
||
IFNDEF \{\$ifndef\ {DotChr1}*\}
|
||
ENDIF \{\$endif\}
|
||
DEFINE \{\$define\ {DotChr1}*\}
|
||
DIRECTIVE \{\${DotChr1}*\}
|
||
|
||
ALPHABET [^ a-zA-Z_0-9\r\n\t\'$#&,:.;@\+\-\*/=<>\^()\[\]\x01]
|
||
|
||
UNICODEARROW \x890
|
||
|
||
%x COMMENT
|
||
%x COMMENT1
|
||
%x COMMENTONELINE
|
||
%x INCL
|
||
%x EXCLUDETEXT
|
||
|
||
%%
|
||
|
||
{OneLineCmnt} {
|
||
|
||
}
|
||
|
||
{DIRECTIVE} {
|
||
if (parsertools.build_tree_for_formatter)
|
||
break;
|
||
|
||
parsertools.DivideDirectiveOn(yytext,out directivename,out directiveparam);
|
||
parsertools.CheckDirectiveParams(directivename,directiveparam); // directivename in UPPERCASE!
|
||
if (directivename == "INCLUDE")
|
||
{
|
||
TryInclude(directiveparam);
|
||
}
|
||
else if (directivename == "IFDEF")
|
||
{
|
||
IfStack.Push(0);
|
||
if (!Defines.Contains(directiveparam))
|
||
{
|
||
BEGIN(EXCLUDETEXT);
|
||
IfExclude = 1;
|
||
}
|
||
}
|
||
else if (directivename == "IFNDEF")
|
||
{
|
||
IfStack.Push(0);
|
||
if (Defines.Contains(directiveparam))
|
||
{
|
||
BEGIN(EXCLUDETEXT);
|
||
IfExclude = 1;
|
||
}
|
||
}
|
||
else if (directivename == "ELSE")
|
||
{
|
||
if (IfStack.Count==0)
|
||
parsertools.AddErrorFromResource("UNNECESSARY $else",CurrentLexLocation);
|
||
if (IfStack.Peek()==1)
|
||
parsertools.AddErrorFromResource("UNNECESSARY $else",CurrentLexLocation);
|
||
IfStack.Pop();
|
||
IfStack.Push(1);
|
||
BEGIN(EXCLUDETEXT);
|
||
IfExclude = 1;
|
||
}
|
||
else if (directivename == "ENDIF")
|
||
{
|
||
if (IfStack.Count == 0)
|
||
parsertools.AddErrorFromResource("UNNECESSARY $endif",CurrentLexLocation);
|
||
IfStack.Pop();
|
||
}
|
||
else if (directivename == "DEFINE")
|
||
{
|
||
if (!Defines.Contains(directiveparam))
|
||
Defines.Add(directiveparam);
|
||
}
|
||
else if (directivename == "UNDEF")
|
||
{
|
||
if (Defines.Contains(directiveparam))
|
||
Defines.Remove(directiveparam);
|
||
}
|
||
}
|
||
|
||
<EXCLUDETEXT>{OneLineCmnt} {
|
||
|
||
}
|
||
|
||
<EXCLUDETEXT>{DIRECTIVE} {
|
||
parsertools.DivideDirectiveOn(yytext,out directivename,out directiveparam);
|
||
parsertools.CheckDirectiveParams(directivename,directiveparam); // directivename in UPPERCASE!
|
||
if (directivename == "IFDEF")
|
||
{
|
||
IfStack.Push(0);
|
||
IfExclude++;
|
||
}
|
||
else if (directivename == "IFNDEF")
|
||
{
|
||
IfStack.Push(0);
|
||
IfExclude++;
|
||
}
|
||
else if (directivename == "ELSE")
|
||
{
|
||
if (IfStack.Peek() == 1)
|
||
parsertools.AddErrorFromResource("UNNECESSARY $else",CurrentLexLocation);
|
||
IfStack.Pop();
|
||
IfStack.Push(1);
|
||
if (IfExclude == 1)
|
||
BEGIN(INITIAL);
|
||
}
|
||
else if (directivename == "ENDIF")
|
||
{
|
||
if (IfStack.Count==0)
|
||
parsertools.AddErrorFromResource("UNNECESSARY $endif",CurrentLexLocation);
|
||
IfStack.Pop();
|
||
IfExclude--;
|
||
if (IfExclude == 0)
|
||
BEGIN(INITIAL);
|
||
}
|
||
else if (IfExclude > 0)
|
||
{
|
||
int ind_to_remove = -1;
|
||
for (int i=0; i<parsertools.compilerDirectives.Count; i++)
|
||
{
|
||
if (parsertools.compilerDirectives[i].source_context.begin_position.line_num == CurrentLexLocation.StartLine &&
|
||
parsertools.compilerDirectives[i].source_context.begin_position.column_num - 2 == CurrentLexLocation.StartColumn + 1)
|
||
{
|
||
ind_to_remove = i;
|
||
break;
|
||
}
|
||
}
|
||
if (ind_to_remove != -1)
|
||
parsertools.compilerDirectives.RemoveAt(ind_to_remove);
|
||
}
|
||
|
||
}
|
||
|
||
<EXCLUDETEXT>.|\n {
|
||
}
|
||
|
||
"{" {
|
||
BEGIN(COMMENT);
|
||
}
|
||
|
||
<COMMENT> "}" {
|
||
BEGIN(INITIAL);
|
||
}
|
||
|
||
<COMMENT>.|\n {
|
||
}
|
||
|
||
"(*" {
|
||
BEGIN(COMMENT1);
|
||
}
|
||
|
||
<COMMENT1> "*)" {
|
||
BEGIN(INITIAL);
|
||
}
|
||
|
||
<COMMENT1>.|\n {
|
||
}
|
||
|
||
"|" { return (int)Tokens.tkVertParen; }
|
||
[#][#][ \t\r\n]+ { yylval = new Union(); yylval.ti = new token_info("##",CurrentLexLocation); return (int)Tokens.tkShortProgram; }
|
||
[#][#][#][ \t\r\n]+ { yylval = new Union(); yylval.ti = new token_info("###",CurrentLexLocation); return (int)Tokens.tkShortSFProgram;
|
||
}
|
||
"&" { return (int)Tokens.tkAmpersend; }
|
||
"," { yylval = new Union(); yylval.ti = new token_info(yytext); return (int)Tokens.tkComma; }
|
||
":" { return (int)Tokens.tkColon; }
|
||
".." { return (int)Tokens.tkDotDot; }
|
||
"." { return (int)Tokens.tkPoint; }
|
||
"(" { return (int)Tokens.tkRoundOpen; }
|
||
")" { return (int)Tokens.tkRoundClose; }
|
||
";" { return (int)Tokens.tkSemiColon; }
|
||
"[" { return (int)Tokens.tkSquareOpen; }
|
||
"]" { return (int)Tokens.tkSquareClose; }
|
||
"?" { return (int)Tokens.tkQuestion; }
|
||
"_" { return (int)Tokens.tkUnderscore; }
|
||
"?." { return (int)Tokens.tkQuestionPoint; }
|
||
"??" { return (int)Tokens.tkDoubleQuestion; }
|
||
"?[" { return (int)Tokens.tkQuestionSquareOpen; }
|
||
"@" { yylval = new Union(); yylval.op = new op_type_node(Operators.AddressOf); return (int)Tokens.tkAddressOf; }
|
||
":=" { yylval = new Union(); yylval.op = new op_type_node(Operators.Assignment); return (int)Tokens.tkAssign; }
|
||
"+=" { yylval = new Union(); yylval.op = new op_type_node(Operators.AssignmentAddition); return (int)Tokens.tkPlusEqual; }
|
||
"-=" { yylval = new Union(); yylval.op = new op_type_node(Operators.AssignmentSubtraction); return (int)Tokens.tkMinusEqual; }
|
||
"*=" { yylval = new Union(); yylval.op = new op_type_node(Operators.AssignmentMultiplication); return (int)Tokens.tkMultEqual; }
|
||
"/=" { yylval = new Union(); yylval.op = new op_type_node(Operators.AssignmentDivision); return (int)Tokens.tkDivEqual; }
|
||
"-" { yylval = new Union(); yylval.op = new op_type_node(Operators.Minus); return (int)Tokens.tkMinus; }
|
||
"+" { yylval = new Union(); yylval.op = new op_type_node(Operators.Plus); return (int)Tokens.tkPlus; }
|
||
"/" { yylval = new Union(); yylval.op = new op_type_node(Operators.Division); return (int)Tokens.tkSlash; }
|
||
"*" { yylval = new Union(); yylval.op = new op_type_node(Operators.Multiplication); return (int)Tokens.tkStar; }
|
||
"**" { yylval = new Union(); yylval.op = new op_type_node(Operators.Power); return (int)Tokens.tkStarStar; }
|
||
"=" { yylval = new Union(); yylval.op = new op_type_node(Operators.Equal); return (int)Tokens.tkEqual; }
|
||
">" { yylval = new Union(); yylval.op = new op_type_node(Operators.Greater); return (int)Tokens.tkGreater; }
|
||
">=" { yylval = new Union(); yylval.op = new op_type_node(Operators.GreaterEqual); return (int)Tokens.tkGreaterEqual; }
|
||
"<" { yylval = new Union(); yylval.op = new op_type_node(Operators.Less); return (int)Tokens.tkLower; }
|
||
"<=" { yylval = new Union(); yylval.op = new op_type_node(Operators.LessEqual); return (int)Tokens.tkLowerEqual; }
|
||
"<>" { yylval = new Union(); yylval.op = new op_type_node(Operators.NotEqual); return (int)Tokens.tkNotEqual; }
|
||
"^" { yylval = new Union(); yylval.op = new op_type_node(Operators.Deref); return (int)Tokens.tkDeref; }
|
||
"->" { yylval = new Union(); yylval.ti = new token_info(yytext); return (int)Tokens.tkArrow; }
|
||
\\[(] { yylval = new Union(); yylval.ti = new token_info(yytext); return (int)Tokens.tkBackSlashRoundOpen; }
|
||
|
||
|
||
\u2192 { yylval = new Union(); yylval.ti = new token_info(yytext); return (int)Tokens.tkArrow; }
|
||
|
||
\<\<expression\>\> { return (int)Tokens.tkParseModeExpression; }
|
||
\<\<statement\>\> { return (int)Tokens.tkParseModeStatement; }
|
||
\<\<type\>\> { return (int)Tokens.tkParseModeType; }
|
||
|
||
\x01 { return (int)Tokens.INVISIBLE; }
|
||
|
||
[&]?{ID} {
|
||
string cur_yytext = yytext;
|
||
int res = Keywords.KeywordOrIDToken(cur_yytext);
|
||
currentLexLocation = CurrentLexLocation;
|
||
if (res == (int)Tokens.tkIdentifier)
|
||
{
|
||
yylval = new Union();
|
||
yylval.id = parsertools.create_ident(cur_yytext,currentLexLocation);
|
||
}
|
||
else
|
||
switch (res)
|
||
{
|
||
case (int)Tokens.tkOr:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.LogicalOR,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkXor:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.BitwiseXOR,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkAnd:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.LogicalAND,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkDiv:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.IntegerDivision,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkMod:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.ModulusRemainder,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkShl:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.BitwiseLeftShift,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkShr:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.BitwiseRightShift,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkNot:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.LogicalNOT,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkAs:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.As,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkIn:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.In,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkIs:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.Is,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkImplicit:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.Implicit,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkExplicit:
|
||
yylval = new Union();
|
||
yylval.op = new op_type_node(Operators.Explicit,currentLexLocation);
|
||
yylval.op.text = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkSizeOf:
|
||
case (int)Tokens.tkTypeOf:
|
||
case (int)Tokens.tkWhere:
|
||
case (int)Tokens.tkArray:
|
||
case (int)Tokens.tkCase:
|
||
case (int)Tokens.tkClass:
|
||
case (int)Tokens.tkAuto:
|
||
case (int)Tokens.tkConst:
|
||
case (int)Tokens.tkConstructor:
|
||
case (int)Tokens.tkDestructor:
|
||
case (int)Tokens.tkDo:
|
||
case (int)Tokens.tkElse:
|
||
case (int)Tokens.tkExcept:
|
||
case (int)Tokens.tkFile:
|
||
case (int)Tokens.tkFinalization:
|
||
case (int)Tokens.tkFinally:
|
||
case (int)Tokens.tkFor:
|
||
case (int)Tokens.tkLoop:
|
||
case (int)Tokens.tkForeach:
|
||
case (int)Tokens.tkFunction:
|
||
case (int)Tokens.tkIf:
|
||
case (int)Tokens.tkImplementation:
|
||
case (int)Tokens.tkInherited:
|
||
case (int)Tokens.tkInitialization:
|
||
case (int)Tokens.tkInterface:
|
||
case (int)Tokens.tkProcedure:
|
||
case (int)Tokens.tkOperator:
|
||
case (int)Tokens.tkProperty:
|
||
case (int)Tokens.tkRaise:
|
||
case (int)Tokens.tkRecord:
|
||
case (int)Tokens.tkRepeat:
|
||
case (int)Tokens.tkSet:
|
||
case (int)Tokens.tkType:
|
||
case (int)Tokens.tkThen:
|
||
case (int)Tokens.tkUntil:
|
||
case (int)Tokens.tkUses:
|
||
case (int)Tokens.tkVar:
|
||
case (int)Tokens.tkWhile:
|
||
case (int)Tokens.tkWith:
|
||
case (int)Tokens.tkNil:
|
||
case (int)Tokens.tkGoto:
|
||
case (int)Tokens.tkOf:
|
||
case (int)Tokens.tkLabel:
|
||
case (int)Tokens.tkLock:
|
||
case (int)Tokens.tkProgram:
|
||
case (int)Tokens.tkEvent:
|
||
case (int)Tokens.tkDefault:
|
||
case (int)Tokens.tkTemplate:
|
||
case (int)Tokens.tkPacked:
|
||
case (int)Tokens.tkExports:
|
||
case (int)Tokens.tkResourceString:
|
||
case (int)Tokens.tkThreadvar:
|
||
case (int)Tokens.tkSealed:
|
||
case (int)Tokens.tkPartial:
|
||
case (int)Tokens.tkParams:
|
||
case (int)Tokens.tkTo:
|
||
case (int)Tokens.tkDownto:
|
||
case (int)Tokens.tkUnit:
|
||
case (int)Tokens.tkNamespace:
|
||
case (int)Tokens.tkLibrary:
|
||
case (int)Tokens.tkExternal:
|
||
case (int)Tokens.tkYield:
|
||
case (int)Tokens.tkSequence:
|
||
case (int)Tokens.tkMatch:
|
||
case (int)Tokens.tkWhen:
|
||
case (int)Tokens.tkStatic:
|
||
case (int)Tokens.tkStep:
|
||
yylval = new Union();
|
||
yylval.ti = new token_info(cur_yytext,currentLexLocation);
|
||
break;
|
||
case (int)Tokens.tkBegin:
|
||
case (int)Tokens.tkEnd:
|
||
case (int)Tokens.tkTry:
|
||
yylval = new Union();
|
||
yylval.ti = new token_info(cur_yytext,currentLexLocation);
|
||
break;
|
||
case (int)Tokens.tkNew:
|
||
case (int)Tokens.tkOn:
|
||
case (int)Tokens.tkName:
|
||
case (int)Tokens.tkPrivate:
|
||
case (int)Tokens.tkProtected:
|
||
case (int)Tokens.tkPublic:
|
||
case (int)Tokens.tkInternal:
|
||
case (int)Tokens.tkRead:
|
||
case (int)Tokens.tkWrite:
|
||
case (int)Tokens.tkIndex:
|
||
yylval = new Union();
|
||
yylval.id = new ident(cur_yytext,currentLexLocation);
|
||
break;
|
||
case (int)Tokens.tkAbstract:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_abstract,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkForward:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_forward,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkOverload:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_overload,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkReintroduce:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_reintroduce,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkOverride:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_override,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkExtensionMethod:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_extension,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
case (int)Tokens.tkVirtual:
|
||
yylval = new Union();
|
||
yylval.id = new procedure_attribute(proc_attribute.attr_virtual,currentLexLocation);
|
||
yylval.id.name = cur_yytext;
|
||
break;
|
||
}
|
||
return res;
|
||
}
|
||
|
||
{INTNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.ex = parsertools.create_int_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkInteger;
|
||
}
|
||
|
||
{BIGINTNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.ex = parsertools.create_bigint_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkBigInteger;
|
||
}
|
||
|
||
|
||
{HEXNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.ex = parsertools.create_hex_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkHex;
|
||
}
|
||
|
||
{FLOATNUM} |
|
||
{EXPNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.ex = parsertools.create_double_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkFloat;
|
||
}
|
||
|
||
{STRINGNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.stn = parsertools.create_string_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkStringLiteral;
|
||
}
|
||
|
||
{FORMATSTRINGNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.stn = parsertools.create_format_string_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkFormatStringLiteral;
|
||
}
|
||
|
||
{SHARPCHARNUM} {
|
||
yylval = new Union();
|
||
currentLexLocation = CurrentLexLocation;
|
||
yylval.stn = parsertools.create_sharp_char_const(yytext,currentLexLocation);
|
||
return (int)Tokens.tkAsciiChar;
|
||
}
|
||
|
||
{OLDDIRECTIVE} {
|
||
yylval = new Union();
|
||
yylval.id = new ident(yytext,CurrentLexLocation);
|
||
return (int)Tokens.tkDirectiveName;
|
||
}
|
||
|
||
[^ \r\n\t] {
|
||
parsertools.AddErrorFromResource("UNEXPECTED_SYMBOL{0}",CurrentLexLocation, yytext);
|
||
return -1;
|
||
}
|
||
|
||
%{
|
||
if (currentLexLocation != null)
|
||
yylloc = currentLexLocation;
|
||
else
|
||
yylloc = CurrentLexLocation;
|
||
currentLexLocation = null;
|
||
%}
|
||
|
||
%%
|
||
public LexLocation CurrentLexLocation
|
||
{
|
||
get {
|
||
return new LexLocation(tokLin, tokCol, tokELin, tokECol, parsertools.CurrentFileName);
|
||
}
|
||
}
|
||
|
||
protected override bool yywrap()
|
||
{
|
||
if (IfStack.Count > 0)
|
||
parsertools.AddErrorFromResource("ENDIF_ABSENT",CurrentLexLocation);
|
||
BEGIN(INITIAL);
|
||
if (buffStack.Count == 0)
|
||
return true;
|
||
RestoreBuffCtx(buffStack.Pop());
|
||
parsertools.CurrentFileName = fNameStack.Pop();
|
||
return false;
|
||
}
|
||
|
||
public override void yyerror(string format, params object[] args)
|
||
{
|
||
string errorMsg = parsertools.CreateErrorString(yytext,args);
|
||
parsertools.AddError(errorMsg,CurrentLexLocation);
|
||
}
|
||
|
||
private void TryInclude(string fName)
|
||
{
|
||
if (fName == null || fName.Length == 0)
|
||
parsertools.AddErrorFromResource("INCLUDE_EMPTY_FILE",CurrentLexLocation);
|
||
else
|
||
try {
|
||
if (fName.StartsWith("'"))
|
||
{
|
||
fName = fName.Substring(1);
|
||
if (fName.EndsWith("'"))
|
||
fName = fName.Substring(0, fName.Length-1);
|
||
}
|
||
BufferContext savedCtx = MkBuffCtx();
|
||
string full_path = fName;
|
||
if (!Path.IsPathRooted(full_path))
|
||
full_path = Path.GetFullPath(Path.Combine(Path.GetDirectoryName(parsertools.CurrentFileName), fName));
|
||
|
||
if (fNameStack.Contains(full_path))
|
||
{
|
||
parsertools.AddErrorFromResource("RECUR_INCLUDE", CurrentLexLocation, fName);
|
||
return;
|
||
}
|
||
|
||
SetSource(File.ReadAllText(full_path), 0);
|
||
fNameStack.Push(parsertools.CurrentFileName);
|
||
parsertools.CurrentFileName = full_path;
|
||
buffStack.Push(savedCtx);
|
||
}
|
||
catch
|
||
{
|
||
parsertools.AddErrorFromResource("INCLUDE_COULDNT_OPEN_FILE{0}",CurrentLexLocation,fName);
|
||
}
|
||
}
|
||
|
||
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD>, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD> Keywords.cs
|