181 lines
7.0 KiB
C#
181 lines
7.0 KiB
C#
//-----------------------------------------------------------------------
|
|
//-----------------------------------------------------------------------
|
|
// file="ExpNodeGenerator.cs"
|
|
// Project: StgSharp
|
|
// AuthorGroup: Nitload Space
|
|
// Copyright (c) Nitload Space. All rights reserved.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person
|
|
// obtaining a copy of this software and associated documentation
|
|
// files (the “Software”), to deal in the Software without restriction,
|
|
// including without limitation the rights to use, copy, modify, merge,
|
|
// publish, distribute, sublicense, and/or sell copies of the Software,
|
|
// and to permit persons to whom the Software is furnished to do so,
|
|
// subject to the following conditions:
|
|
//
|
|
// The above copyright notice and
|
|
// this permission notice shall be included in all copies
|
|
// or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED “AS IS”,
|
|
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
|
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
// ARISING FROM, OUT OF OR IN CONNECTION WITH
|
|
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
//
|
|
//-----------------------------------------------------------------------
|
|
//-----------------------------------------------------------------------
|
|
using StgSharp.Threading;
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Diagnostics;
|
|
using System.Linq;
|
|
using System.Text;
|
|
using System.Threading.Tasks;
|
|
|
|
using ExpKeyWord = StgSharp.Script.Express.ExpCompile.KeyWord;
|
|
|
|
namespace StgSharp.Script.Express
|
|
{
|
|
public partial class ExpNodeGenerator
|
|
{
|
|
|
|
private const int EndLine = 1;
|
|
private const int TokenGenerated = 0;
|
|
private const int TokenTypeNotMatch = -1;
|
|
|
|
private CompileStack<ExpNode, IExpElementSource> _cache;
|
|
|
|
private ExpNode _lastStatement;
|
|
|
|
private GeneratedExpSchema _context;
|
|
private IExpElementSource _local;
|
|
|
|
public ExpNodeGenerator()
|
|
{
|
|
_cache = new CompileStack<ExpNode, IExpElementSource>();
|
|
}
|
|
|
|
/**/
|
|
|
|
/// <summary>
|
|
/// Append a token to top of cache. This method will automatically convert token to node if
|
|
/// meets separators or operators.
|
|
/// </summary>
|
|
public void AppendToken( Token expToken )
|
|
{
|
|
switch( expToken.Flag ) {
|
|
// operand, check precedence and push
|
|
case TokenFlag.Symbol_Unary or TokenFlag.Symbol_Binary:
|
|
int cmp = -1;
|
|
processPrecedence:
|
|
Token tmp = _cache.PeekOperator();
|
|
cmp = CompareOperatorPrecedence( expToken, tmp );
|
|
if( cmp <= 0 ) {
|
|
ConvertOneOperator();
|
|
goto processPrecedence;
|
|
}
|
|
_cache.PushOperand( expToken );
|
|
break;
|
|
|
|
// literal, construxt and ppush
|
|
case TokenFlag.Number or TokenFlag.String:
|
|
_cache.PushOperand( expToken );
|
|
break;
|
|
|
|
// instance ref, make ref and push
|
|
// function call, push as operator
|
|
// keyword, call TryParseKeyWord method to process
|
|
// name of member in instance, parse as MemberNameNode
|
|
case TokenFlag.Member:
|
|
if( _context.TryGetFunction( expToken.Value, out _ ) ) {
|
|
_cache.PushOperator( expToken );
|
|
} else if( _local.TryGetMember(
|
|
expToken.Value, out ExpNode? node ) ) {
|
|
if( node is ExpElementInstanceBase instance ) {
|
|
_cache.PushOperand(
|
|
instance.MakeReference( expToken ) );
|
|
return; // ref of an instance
|
|
}
|
|
} else if( TryParseKeyWord( expToken ) ) {
|
|
return;
|
|
} else {
|
|
_cache.PushOperand(
|
|
new ExpElementMemberNameNode( expToken ) );
|
|
}
|
|
break;
|
|
case TokenFlag.Separator_Single: //a , ; found
|
|
// if operator stack is not empty, convert all operators to node until meet a same separator
|
|
// or OperandAheadOfSeparator property is less than certain value
|
|
_cache.PushOperator( expToken );
|
|
break;
|
|
case TokenFlag.Separator_Left: //a ( [ { found
|
|
// check if the last token is a function name, loop block or branch
|
|
// then increase depth
|
|
_cache.PushOperator( expToken );
|
|
break;
|
|
case TokenFlag.Separator_Right: //a } ] ) found
|
|
//Close current depth and cache call node in this depth as a partial AST
|
|
break;
|
|
case TokenFlag.Index_Left: // a [ found
|
|
break;
|
|
case TokenFlag.Index_Right: // a ] found
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
public ExpNode GetNextOperandCache()
|
|
{
|
|
if( _cache.PopOperand( out Token t, out ExpNode? n ) ) {
|
|
return n;
|
|
} else { }
|
|
|
|
throw new NotImplementedException();
|
|
}
|
|
|
|
/// <summary>
|
|
/// WARNING: This method cannot process INDEXOF, FUNCTION CALLING, LOOP and any ENDING
|
|
/// SYMBOLS.
|
|
/// </summary>
|
|
private void ConvertOneOperator()
|
|
{
|
|
Token @operator = _cache.PopOperator();
|
|
|
|
switch( @operator.Flag ) {
|
|
case TokenFlag.Symbol_Unary:
|
|
TryGenerateUnaryNode( @operator, out ExpNode? node );
|
|
_cache.PushOperand( node );
|
|
break;
|
|
case TokenFlag.Symbol_Binary:
|
|
TryGenerateBinaryNode( @operator, out node );
|
|
_cache.PushOperand( node );
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
private bool TryParseKeyWord( Token t )
|
|
{
|
|
if( t.Value == ExpKeyWord.True ) {
|
|
_cache.PushOperand( new ExpBoolNode( t, true ) );
|
|
return true;
|
|
} else if( t.Value == ExpKeyWord.False ) {
|
|
_cache.PushOperand( new ExpBoolNode( t, false ) );
|
|
return true;
|
|
} else if( true ) {
|
|
throw new NotImplementedException();
|
|
}
|
|
return false;
|
|
}
|
|
|
|
/**/
|
|
}
|
|
}
|