//----------------------------------------------------------------------- //----------------------------------------------------------------------- // 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 _cache; private Stack _operandsNode; private Stack _operandsToken; private Stack _operators; public ExpNodeGenerator() { _operators = new Stack(); _operandsToken = new Stack(); } /// /// Append a token to top of cache. This method will automatically convert token to node if /// meets separators or operators. /// /// public void AppendToken( Token expToken ) { switch( expToken.Flag ) { case TokenFlag.Symbol_Unary or TokenFlag.Symbol_Binary: _operandsToken.Push( expToken ); break; case TokenFlag.Number or TokenFlag.String or TokenFlag.Member: break; case TokenFlag.Separator_Single: break; case TokenFlag.Separator_Left: break; case TokenFlag.Separator_Right: break; case TokenFlag.Index_Left: break; case TokenFlag.Index_Right: break; default: break; } } public void CacheNextOperandNode( ExpNode node ) { _operandsNode.Push( node ); } public AbstractSyntaxTree CloseAndDispose( ) { if( _operandsToken.Count != 0 ) { // convert rest to AST } return new AbstractSyntaxTree(); } public ExpNode GenerateNode( Token t ) { switch( t.Flag ) { case TokenFlag.Symbol_Unary: break; case TokenFlag.Symbol_Binary: break; case TokenFlag.Number: break; case TokenFlag.String: break; case TokenFlag.Member: break; case TokenFlag.Separator_Single: break; case TokenFlag.Separator_Left: break; case TokenFlag.Separator_Right: break; case TokenFlag.Index_Left: break; case TokenFlag.Index_Right: break; default: break; } } public int GetNextOperandCache( out Token? token, out ExpNode? node ) { if( _operandsNode.Count != 0 ) { node = _operandsNode.Pop(); token = null!; return 2; } if( _operandsToken.Count != 0 ) { token = _operandsToken.Pop(); node = null!; return 1; } token = null; node = null!; return 0; } } }