summaryrefslogtreecommitdiffstats
path: root/src/DotNetOpenAuth.BuildTasks/ParseMaster.cs
diff options
context:
space:
mode:
authorAndrew Arnott <andrewarnott@gmail.com>2009-09-27 21:26:15 -0700
committerAndrew Arnott <andrewarnott@gmail.com>2009-09-27 21:26:15 -0700
commitb9c010dfab0a2e526a4719fdf7c1454ef20660b3 (patch)
tree50b6d334c6d387c6d01a150b3a6801114addc834 /src/DotNetOpenAuth.BuildTasks/ParseMaster.cs
parentf1ccc1033b430153a0006bb6534bde6dbbb7fb30 (diff)
downloadDotNetOpenAuth-b9c010dfab0a2e526a4719fdf7c1454ef20660b3.zip
DotNetOpenAuth-b9c010dfab0a2e526a4719fdf7c1454ef20660b3.tar.gz
DotNetOpenAuth-b9c010dfab0a2e526a4719fdf7c1454ef20660b3.tar.bz2
Javascript is now packed for release builds.
Diffstat (limited to 'src/DotNetOpenAuth.BuildTasks/ParseMaster.cs')
-rw-r--r--src/DotNetOpenAuth.BuildTasks/ParseMaster.cs250
1 files changed, 250 insertions, 0 deletions
diff --git a/src/DotNetOpenAuth.BuildTasks/ParseMaster.cs b/src/DotNetOpenAuth.BuildTasks/ParseMaster.cs
new file mode 100644
index 0000000..7edba29
--- /dev/null
+++ b/src/DotNetOpenAuth.BuildTasks/ParseMaster.cs
@@ -0,0 +1,250 @@
+using System;
+using System.Text;
+using System.Text.RegularExpressions;
+using System.Collections;
+using System.Collections.Specialized;
+
+/*
+ ParseMaster, version 1.0 (pre-release) (2005/02/01) x4
+ Copyright 2005, Dean Edwards
+ Web: http://dean.edwards.name/
+
+ This software is licensed under the CC-GNU LGPL
+ Web: http://creativecommons.org/licenses/LGPL/2.1/
+
+ Ported to C# by Jesse Hansen, twindagger2k@msn.com
+*/
+
+namespace Dean.Edwards
+{
+ /// <summary>
+ /// a multi-pattern parser
+ /// </summary>
+ internal class ParseMaster
+ {
+ // used to determine nesting levels
+ Regex GROUPS = new Regex("\\("),
+ SUB_REPLACE = new Regex("\\$"),
+ INDEXED = new Regex("^\\$\\d+$"),
+ ESCAPE = new Regex("\\\\."),
+ QUOTE = new Regex("'"),
+ DELETED = new Regex("\\x01[^\\x01]*\\x01");
+
+ /// <summary>
+ /// Delegate to call when a regular expression is found.
+ /// Use match.Groups[offset + &lt;group number&gt;].Value to get
+ /// the correct subexpression
+ /// </summary>
+ public delegate string MatchGroupEvaluator(Match match, int offset);
+
+ private string DELETE(Match match, int offset)
+ {
+ return "\x01" + match.Groups[offset].Value + "\x01";
+ }
+
+ private bool ignoreCase = false;
+ private char escapeChar = '\0';
+
+ /// <summary>
+ /// Ignore Case?
+ /// </summary>
+ public bool IgnoreCase
+ {
+ get { return ignoreCase; }
+ set { ignoreCase = value; }
+ }
+
+ /// <summary>
+ /// Escape Character to use
+ /// </summary>
+ public char EscapeChar
+ {
+ get { return escapeChar; }
+ set { escapeChar = value; }
+ }
+
+ /// <summary>
+ /// Add an expression to be deleted
+ /// </summary>
+ /// <param name="expression">Regular Expression String</param>
+ public void Add(string expression)
+ {
+ Add(expression, string.Empty);
+ }
+
+ /// <summary>
+ /// Add an expression to be replaced with the replacement string
+ /// </summary>
+ /// <param name="expression">Regular Expression String</param>
+ /// <param name="replacement">Replacement String. Use $1, $2, etc. for groups</param>
+ public void Add(string expression, string replacement)
+ {
+ if (replacement == string.Empty)
+ add(expression, new MatchGroupEvaluator(DELETE));
+
+ add(expression, replacement);
+ }
+
+ /// <summary>
+ /// Add an expression to be replaced using a callback function
+ /// </summary>
+ /// <param name="expression">Regular expression string</param>
+ /// <param name="replacement">Callback function</param>
+ public void Add(string expression, MatchGroupEvaluator replacement)
+ {
+ add(expression, replacement);
+ }
+
+ /// <summary>
+ /// Executes the parser
+ /// </summary>
+ /// <param name="input">input string</param>
+ /// <returns>parsed string</returns>
+ public string Exec(string input)
+ {
+ return DELETED.Replace(unescape(getPatterns().Replace(escape(input), new MatchEvaluator(replacement))), string.Empty);
+ //long way for debugging
+ /*input = escape(input);
+ Regex patterns = getPatterns();
+ input = patterns.Replace(input, new MatchEvaluator(replacement));
+ input = DELETED.Replace(input, string.Empty);
+ return input;*/
+ }
+
+ ArrayList patterns = new ArrayList();
+ private void add(string expression, object replacement)
+ {
+ Pattern pattern = new Pattern();
+ pattern.expression = expression;
+ pattern.replacement = replacement;
+ //count the number of sub-expressions
+ // - add 1 because each group is itself a sub-expression
+ pattern.length = GROUPS.Matches(internalEscape(expression)).Count + 1;
+
+ //does the pattern deal with sup-expressions?
+ if (replacement is string && SUB_REPLACE.IsMatch((string) replacement))
+ {
+ string sreplacement = (string) replacement;
+ // a simple lookup (e.g. $2)
+ if (INDEXED.IsMatch(sreplacement))
+ {
+ pattern.replacement = int.Parse(sreplacement.Substring(1)) - 1;
+ }
+ }
+
+ patterns.Add(pattern);
+ }
+
+ /// <summary>
+ /// builds the patterns into a single regular expression
+ /// </summary>
+ /// <returns></returns>
+ private Regex getPatterns()
+ {
+ StringBuilder rtrn = new StringBuilder(string.Empty);
+ foreach (object pattern in patterns)
+ {
+ rtrn.Append(((Pattern) pattern).ToString() + "|");
+ }
+ rtrn.Remove(rtrn.Length - 1, 1);
+ return new Regex(rtrn.ToString(), ignoreCase ? RegexOptions.IgnoreCase : RegexOptions.None );
+ }
+
+ /// <summary>
+ /// Global replacement function. Called once for each match found
+ /// </summary>
+ /// <param name="match">Match found</param>
+ private string replacement(Match match)
+ {
+ int i = 1, j = 0;
+ Pattern pattern;
+ //loop through the patterns
+ while (!((pattern = (Pattern) patterns[j++]) == null))
+ {
+ //do we have a result?
+ if (match.Groups[i].Value != string.Empty)
+ {
+ object replacement = pattern.replacement;
+ if (replacement is MatchGroupEvaluator)
+ {
+ return ((MatchGroupEvaluator) replacement)(match, i);
+ }
+ else if (replacement is int)
+ {
+ return match.Groups[(int) replacement + i].Value;
+ }
+ else
+ {
+ //string, send to interpreter
+ return replacementString(match, i, (string) replacement, pattern.length);
+ }
+ }
+ else //skip over references to sub-expressions
+ i += pattern.length;
+ }
+ return match.Value; //should never be hit, but you never know
+ }
+
+ /// <summary>
+ /// Replacement function for complicated lookups (e.g. Hello $3 $2)
+ /// </summary>
+ private string replacementString(Match match, int offset, string replacement, int length)
+ {
+ while (length > 0)
+ {
+ replacement = replacement.Replace("$" + length--, match.Groups[offset + length].Value);
+ }
+ return replacement;
+ }
+
+ private StringCollection escaped = new StringCollection();
+
+ //encode escaped characters
+ private string escape(string str)
+ {
+ if (escapeChar == '\0')
+ return str;
+ Regex escaping = new Regex("\\\\(.)");
+ return escaping.Replace(str, new MatchEvaluator(escapeMatch));
+ }
+
+ private string escapeMatch(Match match)
+ {
+ escaped.Add(match.Groups[1].Value);
+ return "\\";
+ }
+
+ //decode escaped characters
+ private int unescapeIndex = 0;
+ private string unescape(string str)
+ {
+ if (escapeChar == '\0')
+ return str;
+ Regex unescaping = new Regex("\\" + escapeChar);
+ return unescaping.Replace(str, new MatchEvaluator(unescapeMatch));
+ }
+
+ private string unescapeMatch(Match match)
+ {
+ return "\\" + escaped[unescapeIndex++];
+ }
+
+ private string internalEscape(string str)
+ {
+ return ESCAPE.Replace(str, "");
+ }
+
+ //subclass for each pattern
+ private class Pattern
+ {
+ public string expression;
+ public object replacement;
+ public int length;
+
+ public override string ToString()
+ {
+ return "(" + expression + ")";
+ }
+ }
+ }
+}