116 lines
4.0 KiB
C#
116 lines
4.0 KiB
C#
//-----------------------------------------------------------------------
|
|
// -----------------------------------------------------------------------
|
|
// file="RegexAstNode"
|
|
// Project: StgSharp
|
|
// AuthorGroup: Nitload
|
|
// Copyright (c) Nitload. 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.RegularAnalysis.Abstraction;
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using System.Text;
|
|
using System.Threading.Tasks;
|
|
|
|
namespace StgSharp.RegularAnalysis.TextRegex
|
|
{
|
|
internal class RegexAstNode : ISyntaxNode<RegexAstNode, RegexElementLabel>
|
|
{
|
|
|
|
private RegexAstNode _left, _right;
|
|
|
|
public RegexAstNode(
|
|
Token<RegexElementLabel> source
|
|
)
|
|
{
|
|
Source = source;
|
|
}
|
|
|
|
public long NodeFlag => (long)Source.Flag;
|
|
|
|
public static RegexAstNode Empty
|
|
{
|
|
get => new EmptyRegexAstNode();
|
|
}
|
|
|
|
public RegexAstNode Previous { get; set; }
|
|
|
|
public RegexAstNode Next { get; set; }
|
|
|
|
public RegexAstNode Left { get; set; }
|
|
|
|
public RegexAstNode Right { get; set; }
|
|
|
|
public RegexElementLabel EqualityTypeConvert
|
|
{
|
|
get => Source.Flag;
|
|
}
|
|
|
|
public string CodeConvertTemplate { get; }
|
|
|
|
public Token<RegexElementLabel> Source { get; }
|
|
|
|
public void AppendNode(
|
|
RegexAstNode nextToken
|
|
) { }
|
|
|
|
public void PrependNode(
|
|
RegexAstNode previousNode
|
|
) { }
|
|
|
|
public static bool TryMergeUnit(
|
|
RegexAstNode prev,
|
|
RegexAstNode next,
|
|
out RegexAstNode result
|
|
)
|
|
{
|
|
Token<RegexElementLabel> pSource = prev.Source;
|
|
Token<RegexElementLabel> nSource = next.Source;
|
|
if (pSource.IsAccurateChar() &&
|
|
nSource.IsAccurateChar() &&
|
|
pSource.Column + pSource.Value.Length == nSource.Column)
|
|
{
|
|
// both are unit types and adjacent
|
|
// and are all accurate unit
|
|
Token<RegexElementLabel> newToken = new Token<RegexElementLabel>($"{pSource.Value}{nSource.Value}",
|
|
pSource.Line,
|
|
pSource.Column,
|
|
RegexElementLabel.UNIT_SPAN);
|
|
result = new RegexAstNode(newToken);
|
|
return true;
|
|
}
|
|
result = Empty;
|
|
return false;
|
|
}
|
|
|
|
private class EmptyRegexAstNode : RegexAstNode
|
|
|
|
{
|
|
|
|
public EmptyRegexAstNode() : base(Token<RegexElementLabel>.Empty) { }
|
|
|
|
}
|
|
|
|
}
|
|
}
|