public SreExpr NOrMoreMatches(Num n, OpenSreExpr inner)
{
int count = int.Parse(n.Text);
return(new SreExpr {
Node = new RepeatNode(inner.Node, count, int.MaxValue)
});
}
public SreExpr NToMMatches(Num n, Num m, OpenSreExpr inner)
{
int from = int.Parse(n.Text);
int to = int.Parse(m.Text);
return(new SreExpr {
Node = new RepeatNode(inner.Node, from, to)
});
}
public SreExpr ZeroOrOne(OpenSreExpr inner)
{
return(new SreExpr {
Node = RepeatNode.Optional(inner.Node)
});
}
public SreExpr OneOrMore(OpenSreExpr items)
{
return(new SreExpr {
Node = RepeatNode.OneOrMore(items.Node)
});
}
public SreExpr Seq2(OpenSreExpr inner)
{
return(Seq1(inner));
}
public SreExpr Seq1(OpenSreExpr inner)
{
return(new SreExpr {
Node = inner.Node
});
}
public SreExpr ZeroOrOne(OpenSreExpr inner)
{
return new SreExpr { Node = RepeatNode.Optional(inner.Node) };
}
public SreExpr ZeroOrMore(OpenSreExpr items)
{
return new SreExpr { Node = RepeatNode.ZeroOrMore(items.Node) };
}
public SreExpr Seq2(OpenSreExpr inner)
{
return Seq1(inner);
}
public SreExpr Seq1(OpenSreExpr inner)
{
return new SreExpr { Node = inner.Node };
}
public SreExpr NToMMatches(Num n, Num m, OpenSreExpr inner)
{
int from = int.Parse(n.Text);
int to = int.Parse(m.Text);
return new SreExpr { Node = new RepeatNode(inner.Node, from, to) };
}
public SreExpr NOrMoreMatches(Num n, OpenSreExpr inner)
{
int count = int.Parse(n.Text);
return new SreExpr { Node = new RepeatNode(inner.Node, count, int.MaxValue) };
}