270 lines
10 KiB
C#
270 lines
10 KiB
C#
//-----------------------------------------------------------------------
|
|
// -----------------------------------------------------------------------
|
|
// file="RegexInterpreter"
|
|
// 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.Reflection.Emit;
|
|
using System.Runtime.CompilerServices;
|
|
using System.Text;
|
|
|
|
using System.Threading.Tasks;
|
|
|
|
namespace StgSharp.RegularAnalysis.Text
|
|
{
|
|
public partial class RegexInterpreter
|
|
{
|
|
|
|
private AbstractSyntaxTree<RegexAstNode, RegexElementLabel> _tree = new();
|
|
private CompileStack<RegexAstNode, RegexElementLabel> _stack = new();
|
|
private Exception _interpreteException;
|
|
private string _source;
|
|
|
|
private RegexInterpreter() { }
|
|
|
|
internal AbstractSyntaxTree<RegexAstNode, RegexElementLabel> Tree
|
|
{
|
|
get
|
|
{
|
|
if (_interpreteException != null) {
|
|
throw new InvalidOperationException("The regex interpretation failed.", _interpreteException);
|
|
}
|
|
return _tree;
|
|
}
|
|
}
|
|
|
|
public static RegexInterpreter Analyze(string regex)
|
|
{
|
|
RegexInterpreter interpreter = new();
|
|
interpreter._source = regex;
|
|
bool isSuccess;
|
|
try
|
|
{
|
|
interpreter.Analyze();
|
|
interpreter.OptimizeTree();
|
|
isSuccess = true;
|
|
}
|
|
catch (Exception ex)
|
|
{
|
|
interpreter._interpreteException = ex;
|
|
isSuccess = false;
|
|
}
|
|
return interpreter;
|
|
}
|
|
|
|
private void Analyze()
|
|
{
|
|
RegexTokenReader reader = new(_source);
|
|
TokenParser<RegexElementLabel, RegexElementLabel> lexer = reader.Pipe(() => new RegexTokenParser());
|
|
|
|
while (lexer.TryReadToken(out Token<RegexElementLabel> token))
|
|
{
|
|
// Console.WriteLine(token.Value);
|
|
if ((token.Flag & RegexElementLabel.SEQUENCE) != 0)
|
|
{
|
|
// char or charset
|
|
_stack.PushOperand(new RegexAstNode(token));
|
|
} else if ((token.Flag & RegexElementLabel.GROUP_BEGIN) != 0)
|
|
{
|
|
_stack.PushOperator(new RegexAstNode(token));
|
|
_stack.IncreaseDepth(0);
|
|
} else if ((token.Flag & RegexElementLabel.GROUP_END) != 0)
|
|
{
|
|
// close all nodes here
|
|
RegexAstNode op;
|
|
while (_stack.TryPopOperator(out op)) {
|
|
ProcessOperator(op);
|
|
}
|
|
if (_stack.OperandInDepthCount != 1) {
|
|
throw new InvalidOperationException();
|
|
}
|
|
_stack.DecreaseDepth();
|
|
op = _stack.PopOperator();
|
|
if (op.Source.Flag != RegexElementLabel.GROUP_BEGIN) {
|
|
throw new InvalidOperationException("Unmatched group begin and end symbol");
|
|
}
|
|
if (op.Source.Value.Length > 1)
|
|
{
|
|
op.Right = _stack.PopOperand();
|
|
_stack.PushOperand(op);
|
|
}
|
|
} else if ((token.Flag & RegexElementLabel.OPERATOR) != 0)
|
|
{
|
|
if (_stack.OperatorInDepthCount == 0)
|
|
{
|
|
// the first operator in stack
|
|
_stack.PushOperator(new RegexAstNode(token));
|
|
} else
|
|
{
|
|
// process operator by precedence
|
|
while (_stack.TryPeekOperator(out RegexAstNode topOp))
|
|
{
|
|
(bool Valid, int Value) cmp = RegexAstNode.ComparePrecedence(topOp.Source.Flag, token.Flag);
|
|
|
|
if (!cmp.Valid) {
|
|
throw new InvalidOperationException("Operators with same precedence are not supported.");
|
|
}
|
|
if (cmp.Value < 0)
|
|
{
|
|
_stack.PopOperator();
|
|
ProcessOperator(topOp);
|
|
continue;
|
|
} else
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
_stack.PushOperator(new RegexAstNode(token));
|
|
}
|
|
}
|
|
}
|
|
if (_stack.Depth == 1)
|
|
{
|
|
if (_stack.OperandInDepthCount != 1 || _stack.OperatorInDepthCount != 0)
|
|
{
|
|
while (_stack.TryPopOperator(out RegexAstNode? op)) {
|
|
ProcessOperator(op);
|
|
}
|
|
}
|
|
if (_stack.OperandInDepthCount == 1 && _stack.OperatorInDepthCount == 0)
|
|
{
|
|
_tree.Root = _stack.PopOperand();
|
|
return;
|
|
}
|
|
}
|
|
throw new InvalidOperationException("Invalid regular expression syntax.");
|
|
}
|
|
|
|
private void OptimizeTree()
|
|
{
|
|
// phase0: scan container and remove no parent nodes
|
|
_ = _tree.AllNodes.RemoveWhere(node => node.Parent == null && node != _tree.Root);
|
|
TreeEnumerator<RegexAstNode, RegexElementLabel> enumerator = new(_tree.Root);
|
|
RegexAstNode current;
|
|
|
|
// phase1: ALT flatten
|
|
// phase2: CONCAT normalize
|
|
int i = 0;
|
|
List<RegexAstNode> altNodes = [];
|
|
while (enumerator.MoveNext())
|
|
{
|
|
current = enumerator.Current;
|
|
if (current.EqualityTypeConvert == RegexElementLabel.ALT)
|
|
{
|
|
RegexAstNode union = FlattenAlt(current);
|
|
altNodes.Add(current);
|
|
current.Right = union;
|
|
current.Left = RegexAstNode.Empty;
|
|
} else if (current.EqualityTypeConvert == RegexElementLabel.CONCAT) {
|
|
RotateConcat(current);
|
|
}
|
|
}
|
|
|
|
List<RegexAstNode> cases = [];
|
|
|
|
// phase3: then ALT union
|
|
foreach (RegexAstNode item in altNodes)
|
|
{
|
|
RegexAstNode _case = item.Right;
|
|
do
|
|
{
|
|
cases.Add(_case);
|
|
_case = _case.Next;
|
|
} while (!RegexAstNode.IsNullOrEmpty(_case));
|
|
RegexAstNode newAlt = MergeAlt(cases);
|
|
item.ReplaceBy(newAlt);
|
|
}
|
|
|
|
// return;
|
|
|
|
// phase4: CONCAT merge
|
|
enumerator.Reset();
|
|
while (enumerator.MoveNext())
|
|
{
|
|
// suppose all concat is now in normalized form,
|
|
// we can merge adjacent unit nodes into a single unit node with string value
|
|
current = enumerator.Current;
|
|
if (current.EqualityTypeConvert == RegexElementLabel.CONCAT)
|
|
{
|
|
if (MergeConcat(current)) {
|
|
enumerator.SkipOnce();
|
|
}
|
|
}
|
|
}
|
|
|
|
// TODO enum AST again , do ALT tail merge and simple ALT front merge
|
|
}
|
|
|
|
private void ProcessOperator(RegexAstNode op)
|
|
{
|
|
if (op.EqualityTypeConvert == RegexElementLabel.CONCAT)
|
|
{
|
|
if (_stack.TryPopOperand(out RegexAstNode? _1) && _stack.TryPopOperand(out RegexAstNode? _2))
|
|
{
|
|
op.Left = _2;
|
|
op.Right = _1;
|
|
_stack.PushOperand(op);
|
|
_tree.AddNode(op);
|
|
_tree.AddNode(_1);
|
|
_tree.AddNode(_2);
|
|
} else
|
|
{
|
|
throw new InvalidOperationException("Insufficient operands for CONCAT operator.");
|
|
}
|
|
} else if (op.EqualityTypeConvert == RegexElementLabel.COUNT)
|
|
{
|
|
if (_stack.TryPopOperand(out RegexAstNode? _1))
|
|
{
|
|
op.Left = _1;
|
|
_stack.PushOperand(op);
|
|
_tree.AddNode(_1);
|
|
_tree.AddNode(op);
|
|
} else
|
|
{
|
|
throw new InvalidOperationException("Insufficient operands for CONCAT operator.");
|
|
}
|
|
} else if (op.EqualityTypeConvert == RegexElementLabel.ALT)
|
|
{
|
|
if (_stack.TryPopOperand(out RegexAstNode? _1) && _stack.TryPopOperand(out RegexAstNode? _2))
|
|
{
|
|
op.Left = _2;
|
|
op.Right = _1;
|
|
_stack.PushOperand(op);
|
|
_tree.AddNode(op);
|
|
_tree.AddNode(_1);
|
|
_tree.AddNode(_2);
|
|
} else
|
|
{
|
|
throw new InvalidOperationException("Insufficient operands for CONCAT operator.");
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|