174 lines
6.6 KiB
C#
174 lines
6.6 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;
|
|
|
|
namespace StgSharp.Script.Express
|
|
{
|
|
public partial class ExpNodeGenerator
|
|
{
|
|
|
|
private const int EndLine = 1;
|
|
private const int TokenGenerated = 0;
|
|
private const int TokenTypeNotMatch = -1;
|
|
|
|
private ExpNode _lastStatement;
|
|
|
|
private GeneratedExpSchema _context;
|
|
private IExpElementSource _local;
|
|
private List<ExpNode> _cache;
|
|
private Stack<TokenNodeStack<ExpNode, IExpElementSource>> _operands;
|
|
private Stack<ExpNode> _operandsNode;
|
|
private Stack<Token> _operandsToken;
|
|
private Stack<Token> _operators;
|
|
|
|
public ExpNodeGenerator()
|
|
{
|
|
_operators = new Stack<Token>();
|
|
_operands = new Stack<TokenNodeStack<ExpNode, IExpElementSource>>();
|
|
}
|
|
|
|
private TokenNodeStack<ExpNode, IExpElementSource> CurrentOperands => _operands.Peek(
|
|
);
|
|
|
|
/// <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 ) {
|
|
case TokenFlag.Symbol_Unary or TokenFlag.Symbol_Binary:
|
|
int cmp = -1;
|
|
processPrecedence:
|
|
Token tmp = _operators.Peek();
|
|
cmp = CompareOperatorPrecedence( expToken, tmp );
|
|
if( cmp <= 0 ) {
|
|
ConvertOneOperator();
|
|
goto processPrecedence;
|
|
}
|
|
CurrentOperands.Push( expToken );
|
|
break;
|
|
case TokenFlag.Number or TokenFlag.String or TokenFlag.Member:
|
|
CurrentOperands.Push( expToken );
|
|
break;
|
|
case TokenFlag.Separator_Single: //a , ; found
|
|
//if operator stack is not empty, convert all operators to node until meet a separator
|
|
Token t;
|
|
ExpNode n = _operandsNode.Peek();
|
|
int count = 0;
|
|
processSection:
|
|
t = _operators.Peek();
|
|
bool isEnd = expToken.Value switch
|
|
{
|
|
"," => ",[(".IndexOf( t.Value[ 0 ] ) != -1,
|
|
";" => ";{".IndexOf( t.Value[ 0 ] ) != -1,
|
|
_ => false
|
|
};
|
|
if( isEnd ) {
|
|
if( count == 0 ) {
|
|
ExpNode newNode = ExpNode.NonOperation(
|
|
string.Empty );
|
|
newNode.AppendNode( n );
|
|
} else {
|
|
ExpNode newNode = _operandsNode.Pop();
|
|
newNode.AppendNode( n );
|
|
CurrentOperands.Push( newNode );
|
|
}
|
|
} else {
|
|
count++;
|
|
ConvertOneOperator();
|
|
goto processSection;
|
|
}
|
|
break;
|
|
case TokenFlag.Separator_Left: //a ( [ { found
|
|
_operators.Push( expToken );
|
|
break;
|
|
case TokenFlag.Separator_Right: //a } ] ) found
|
|
break;
|
|
case TokenFlag.Index_Left: // a [ found
|
|
break;
|
|
case TokenFlag.Index_Right: // a ] found
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
public ExpNode GetNextOperandCache()
|
|
{
|
|
if( CurrentOperands.Pop( out Token t, out ExpNode? n ) ) {
|
|
return n;
|
|
} else {
|
|
//TODO convert token to a node
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// WARNING: This method cannot process INDEXOF, FUNCTION CALLING, LOOP and any ENDING
|
|
/// SYMBOLS.
|
|
/// </summary>
|
|
private void ConvertOneOperator()
|
|
{
|
|
Token @operator = _operators.Pop();
|
|
switch( @operator.Flag ) {
|
|
case TokenFlag.Symbol_Unary:
|
|
TryGenerateUnaryNode( @operator, out ExpNode? node );
|
|
CurrentOperands.Push( node );
|
|
break;
|
|
case TokenFlag.Symbol_Binary:
|
|
TryGenerateBinaryNode( @operator, out node );
|
|
CurrentOperands.Push( node );
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
private void DecreaseOperandsStackDepth()
|
|
{
|
|
_operands.Pop();
|
|
}
|
|
|
|
private void IncreaseOperandsStackDepth()
|
|
{
|
|
_operands.Push( new TokenNodeStack<ExpNode, IExpElementSource>() );
|
|
}
|
|
|
|
}
|
|
}
|