mail 2.1.5.2 → 2.1.5.3

data/lib/mail/vendor/treetop-1.4.4/doc/site.rb

@@ -1,112 +0,0 @@
-require 'rubygems'
-require 'erector'
-require "#{File.dirname(__FILE__)}/sitegen"
-require 'fileutils'
-require 'bluecloth'
-
-class Layout < Erector::Widget
-  def render
-    html do
-      head do
-        link :rel => "stylesheet",
-        :type => "text/css",
-        :href => "./screen.css"
-        
-        rawtext %(
-          <script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
-          </script>
-          <script type="text/javascript">
-          _uacct = "UA-3418876-1";
-          urchinTracker();
-          </script>
-        )
-      end
-
-      body do
-        div :id => 'top' do
-          div :id => 'main_navigation' do
-            main_navigation
-          end
-        end
-        div :id => 'middle' do
-          div :id => 'content' do
-            content
-          end
-        end
-        div :id => 'bottom' do
-
-        end
-      end
-    end
-  end
-
-  def main_navigation
-    ul do
-      li { link_to "Documentation", SyntacticRecognition, Documentation }
-      li { link_to "Contribute", Contribute }
-      li { link_to "Home", Index }
-    end
-  end
-
-  def content
-  end
-end
-
-class Index < Layout
-  def content
-    bluecloth "index.markdown"
-  end
-end
-
-class Documentation < Layout
-  abstract
-
-  def content
-    div :id => 'secondary_navigation' do
-      ul do
-        li { link_to 'Syntax', SyntacticRecognition }
-        li { link_to 'Semantics', SemanticInterpretation }
-        li { link_to 'Using In Ruby', UsingInRuby }
-        li { link_to 'Advanced Techniques', PitfallsAndAdvancedTechniques }
-      end
-    end
-    
-    div :id => 'documentation_content' do
-      documentation_content
-    end
-  end
-end
-
-class SyntacticRecognition < Documentation
-  def documentation_content
-    bluecloth "syntactic_recognition.markdown"
-  end
-end
-
-class SemanticInterpretation < Documentation
-  def documentation_content
-    bluecloth "semantic_interpretation.markdown"
-  end
-end
-
-class UsingInRuby < Documentation
-  def documentation_content
-    bluecloth "using_in_ruby.markdown"
-  end
-end
-
-class PitfallsAndAdvancedTechniques < Documentation
-  def documentation_content
-    bluecloth "pitfalls_and_advanced_techniques.markdown"
-  end
-end
-
-
-class Contribute < Layout
-  def content
-    bluecloth "contributing_and_planned_features.markdown"
-  end
-end
-
-
-Layout.generate_site

data/lib/mail/vendor/treetop-1.4.4/doc/sitegen.rb

@@ -1,65 +0,0 @@
-class Layout < Erector::Widget
-
-  class << self
-    def inherited(page_class)
-      puts page_class
-      (@@page_classes ||= []) << page_class
-    end
-
-    def generate_site
-      FileUtils.mkdir_p(site_dir)
-      @@page_classes.each do |page_class|
-        page_class.generate_html unless page_class.abstract?
-        puts page_class
-      end
-    end
-
-    def generate_html
-      File.open(absolute_path, 'w') do |file|
-        file.write(new.render)
-      end
-    end
-
-    def absolute_path
-      absolutize(relative_path)
-    end
-
-    def relative_path
-      "#{name.gsub('::', '_').underscore}.html"
-    end
-
-    def absolutize(relative_path)
-      File.join(site_dir, relative_path)
-    end
-
-    def abstract
-      @abstract = true
-    end
-
-    def abstract?
-      @abstract
-    end
-
-    def site_dir
-      File.join(File.dirname(__FILE__), "site")
-    end
-  end
-
-  def bluecloth(relative_path)
-    File.open(File.join(File.dirname(__FILE__), relative_path)) do |file|
-      rawtext BlueCloth.new(file.read).to_html
-    end
-  end
-
-  def absolutize(relative_path)
-    self.class.absolutize(relative_path)
-  end
-
-  def link_to(link_text, page_class, section_class=nil)
-    if instance_of?(page_class) || section_class && is_a?(section_class)
-      text link_text
-    else
-      a link_text, :href => page_class.relative_path
-    end
-  end
-end

data/lib/mail/vendor/treetop-1.4.4/doc/syntactic_recognition.markdown

@@ -1,100 +0,0 @@
-#Syntactic Recognition 
-Treetop grammars are written in a custom language based on parsing expression grammars. Literature on the subject of <a href="http://en.wikipedia.org/wiki/Parsing_expression_grammar">parsing expression grammars</a> is useful in writing Treetop grammars.
-
-#Grammar Structure
-Treetop grammars look like this:
-
-    grammar GrammarName
-      rule rule_name
-        ...
-      end
-      
-      rule rule_name
-        ...
-      end
-      
-      ...
-    end
-
-The main keywords are:
-
-* `grammar` : This introduces a new grammar. It is followed by a constant name to which the grammar will be bound when it is loaded.
-
-* `rule` : This defines a parsing rule within the grammar. It is followed by a name by which this rule can be referenced within other rules. It is then followed by a parsing expression defining the rule.
-
-#Parsing Expressions
-Each rule associates a name with a _parsing expression_. Parsing expressions are a generalization of vanilla regular expressions. Their key feature is the ability to reference other expressions in the grammar by name.
-
-##Terminal Symbols
-###Strings
-Strings are surrounded in double or single quotes and must be matched exactly.
-
-* `"foo"`
-* `'foo'`
-  
-###Character Classes
-Character classes are surrounded by brackets. Their semantics are identical to those used in Ruby's regular expressions.
-
-* `[a-zA-Z]`
-* `[0-9]`
-
-###The Anything Symbol
-The anything symbol is represented by a dot (`.`) and matches any single character.
-
-##Nonterminal Symbols
-Nonterminal symbols are unquoted references to other named rules. They are equivalent to an inline substitution of the named expression.
-
-    rule foo
-      "the dog " bar
-    end
-    
-    rule bar
-      "jumped"
-    end
-
-The above grammar is equivalent to:
-
-    rule foo
-      "the dog jumped"
-    end
-
-##Ordered Choice
-Parsers attempt to match ordered choices in left-to-right order, and stop after the first successful match.
-
-    "foobar" / "foo" / "bar"
-    
-Note that if `"foo"` in the above expression came first, `"foobar"` would never be matched.
-
-##Sequences
-
-Sequences are a space-separated list of parsing expressions. They have higher precedence than choices, so choices must be parenthesized to be used as the elements of a sequence. 
-
-    "foo" "bar" ("baz" / "bop")
-
-##Zero or More
-Parsers will greedily match an expression zero or more times if it is followed by the star (`*`) symbol.
-
-* `'foo'*` matches the empty string, `"foo"`, `"foofoo"`, etc.
-
-##One or More
-Parsers will greedily match an expression one or more times if it is followed by the star (`+`) symbol.
-
-* `'foo'+` does not match the empty string, but matches `"foo"`, `"foofoo"`, etc.
-
-##Optional Expressions
-An expression can be declared optional by following it with a question mark (`?`).
-
-* `'foo'?` matches `"foo"` or the empty string.
-
-##Lookahead Assertions
-Lookahead assertions can be used to give parsing expressions a limited degree of context-sensitivity. The parser will look ahead into the buffer and attempt to match an expression without consuming input.
-
-###Positive Lookahead Assertion
-Preceding an expression with an ampersand `(&)` indicates that it must match, but no input will be consumed in the process of determining whether this is true.
-
-* `"foo" &"bar"` matches `"foobar"` but only consumes up to the end `"foo"`. It will not match `"foobaz"`.
-
-###Negative Lookahead Assertion
-Preceding an expression with a bang `(!)` indicates that the expression must not match, but no input will be consumed in the process of determining whether this is true.
-
-* `"foo" !"bar"` matches `"foobaz"` but only consumes up to the end `"foo"`. It will not match `"foobar"`.

data/lib/mail/vendor/treetop-1.4.4/doc/using_in_ruby.markdown

@@ -1,28 +0,0 @@
-#Using Treetop Grammars in Ruby
-##Using the Command Line Compiler
-You can `.treetop` files into Ruby source code with the `tt` command line script. `tt` takes an list of files with a `.treetop` extension and compiles them into `.rb` files of the same name. You can then `require` these files like any other Ruby script. Alternately, you can supply just one `.treetop` file and a `-o` flag to name specify the name of the output file. Improvements to this compilation script are welcome.
-
-    tt foo.treetop bar.treetop
-    tt foo.treetop -o foogrammar.rb
-
-##Loading A Grammar Directly
-The Polyglot gem makes it possible to load `.treetop` or `.tt` files directly with `require`. This will invoke `Treetop.load`, which automatically compiles the grammar to Ruby and then evaluates the Ruby source. If you are getting errors in methods you define on the syntax tree, try using the command line compiler for better stack trace feedback. A better solution to this issue is in the works.
-
-In order to use Polyglot dynamic loading of `.treetop` or `.tt` files though, you need to require the Polyglot gem before you require the Treetop gem as Treetop will only create hooks into Polyglot for the treetop files if Polyglot is already loaded.  So you need to use:
-
-    require 'polyglot'
-    require 'treetop'
-
-in order to use Polyglot auto loading with Treetop in Ruby.
-
-##Instantiating and Using Parsers
-If a grammar by the name of `Foo` is defined, the compiled Ruby source will define a `FooParser` class. To parse input, create an instance and call its `parse` method with a string. The parser will return the syntax tree of the match or `nil` if there is a failure.
-
-    Treetop.load "arithmetic"
-    
-    parser = ArithmeticParser.new
-    if parser.parse('1+1')
-      puts 'success'
-    else
-      puts 'failure'
-    end

data/lib/mail/vendor/treetop-1.4.4/examples/lambda_calculus/arithmetic.rb

@@ -1,551 +0,0 @@
-module Arithmetic
-  include Treetop::Runtime
-  
-  def root
-    @root || :expression
-  end
-  
-  def _nt_expression
-    start_index = index
-    cached = node_cache[:expression][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    r1 = _nt_comparative
-    if r1.success?
-      r0 = r1
-    else
-      r2 = _nt_additive
-      if r2.success?
-        r0 = r2
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:expression][start_index] = r0
-    
-    return r0
-  end
-  
-  module Comparative0
-    def operand_1
-      elements[0]
-    end
-    
-    def space
-      elements[1]
-    end
-    
-    def operator
-      elements[2]
-    end
-    
-    def space
-      elements[3]
-    end
-    
-    def operand_2
-      elements[4]
-    end
-  end
-  
-  def _nt_comparative
-    start_index = index
-    cached = node_cache[:comparative][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0, s0 = index, []
-    r1 = _nt_additive
-    s0 << r1
-    if r1.success?
-      r2 = _nt_space
-      s0 << r2
-      if r2.success?
-        r3 = _nt_equality_op
-        s0 << r3
-        if r3.success?
-          r4 = _nt_space
-          s0 << r4
-          if r4.success?
-            r5 = _nt_additive
-            s0 << r5
-          end
-        end
-      end
-    end
-    if s0.last.success?
-      r0 = (BinaryOperation).new(input, i0...index, s0)
-      r0.extend(Comparative0)
-    else
-      self.index = i0
-      r0 = ParseFailure.new(input, i0)
-    end
-    
-    node_cache[:comparative][start_index] = r0
-    
-    return r0
-  end
-  
-  module EqualityOp0
-    def apply(a, b)
-      a == b
-    end
-  end
-  
-  def _nt_equality_op
-    start_index = index
-    cached = node_cache[:equality_op][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    r0 = parse_terminal('==', SyntaxNode, EqualityOp0)
-    
-    node_cache[:equality_op][start_index] = r0
-    
-    return r0
-  end
-  
-  module Additive0
-    def operand_1
-      elements[0]
-    end
-    
-    def space
-      elements[1]
-    end
-    
-    def operator
-      elements[2]
-    end
-    
-    def space
-      elements[3]
-    end
-    
-    def operand_2
-      elements[4]
-    end
-  end
-  
-  def _nt_additive
-    start_index = index
-    cached = node_cache[:additive][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    i1, s1 = index, []
-    r2 = _nt_multitive
-    s1 << r2
-    if r2.success?
-      r3 = _nt_space
-      s1 << r3
-      if r3.success?
-        r4 = _nt_additive_op
-        s1 << r4
-        if r4.success?
-          r5 = _nt_space
-          s1 << r5
-          if r5.success?
-            r6 = _nt_additive
-            s1 << r6
-          end
-        end
-      end
-    end
-    if s1.last.success?
-      r1 = (BinaryOperation).new(input, i1...index, s1)
-      r1.extend(Additive0)
-    else
-      self.index = i1
-      r1 = ParseFailure.new(input, i1)
-    end
-    if r1.success?
-      r0 = r1
-    else
-      r7 = _nt_multitive
-      if r7.success?
-        r0 = r7
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:additive][start_index] = r0
-    
-    return r0
-  end
-  
-  module AdditiveOp0
-    def apply(a, b)
-      a + b
-    end
-  end
-  
-  module AdditiveOp1
-    def apply(a, b)
-      a - b
-    end
-  end
-  
-  def _nt_additive_op
-    start_index = index
-    cached = node_cache[:additive_op][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    r1 = parse_terminal('+', SyntaxNode, AdditiveOp0)
-    if r1.success?
-      r0 = r1
-    else
-      r2 = parse_terminal('-', SyntaxNode, AdditiveOp1)
-      if r2.success?
-        r0 = r2
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:additive_op][start_index] = r0
-    
-    return r0
-  end
-  
-  module Multitive0
-    def operand_1
-      elements[0]
-    end
-    
-    def space
-      elements[1]
-    end
-    
-    def operator
-      elements[2]
-    end
-    
-    def space
-      elements[3]
-    end
-    
-    def operand_2
-      elements[4]
-    end
-  end
-  
-  def _nt_multitive
-    start_index = index
-    cached = node_cache[:multitive][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    i1, s1 = index, []
-    r2 = _nt_primary
-    s1 << r2
-    if r2.success?
-      r3 = _nt_space
-      s1 << r3
-      if r3.success?
-        r4 = _nt_multitive_op
-        s1 << r4
-        if r4.success?
-          r5 = _nt_space
-          s1 << r5
-          if r5.success?
-            r6 = _nt_multitive
-            s1 << r6
-          end
-        end
-      end
-    end
-    if s1.last.success?
-      r1 = (BinaryOperation).new(input, i1...index, s1)
-      r1.extend(Multitive0)
-    else
-      self.index = i1
-      r1 = ParseFailure.new(input, i1)
-    end
-    if r1.success?
-      r0 = r1
-    else
-      r7 = _nt_primary
-      if r7.success?
-        r0 = r7
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:multitive][start_index] = r0
-    
-    return r0
-  end
-  
-  module MultitiveOp0
-    def apply(a, b)
-      a * b
-    end
-  end
-  
-  module MultitiveOp1
-    def apply(a, b)
-      a / b
-    end
-  end
-  
-  def _nt_multitive_op
-    start_index = index
-    cached = node_cache[:multitive_op][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    r1 = parse_terminal('*', SyntaxNode, MultitiveOp0)
-    if r1.success?
-      r0 = r1
-    else
-      r2 = parse_terminal('/', SyntaxNode, MultitiveOp1)
-      if r2.success?
-        r0 = r2
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:multitive_op][start_index] = r0
-    
-    return r0
-  end
-  
-  module Primary0
-    def space
-      elements[1]
-    end
-    
-    def expression
-      elements[2]
-    end
-    
-    def space
-      elements[3]
-    end
-    
-  end
-  
-  module Primary1
-    def eval(env={})
-      expression.eval(env)
-    end
-  end
-  
-  def _nt_primary
-    start_index = index
-    cached = node_cache[:primary][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    r1 = _nt_variable
-    if r1.success?
-      r0 = r1
-    else
-      r2 = _nt_number
-      if r2.success?
-        r0 = r2
-      else
-        i3, s3 = index, []
-        r4 = parse_terminal('(', SyntaxNode)
-        s3 << r4
-        if r4.success?
-          r5 = _nt_space
-          s3 << r5
-          if r5.success?
-            r6 = _nt_expression
-            s3 << r6
-            if r6.success?
-              r7 = _nt_space
-              s3 << r7
-              if r7.success?
-                r8 = parse_terminal(')', SyntaxNode)
-                s3 << r8
-              end
-            end
-          end
-        end
-        if s3.last.success?
-          r3 = (SyntaxNode).new(input, i3...index, s3)
-          r3.extend(Primary0)
-          r3.extend(Primary1)
-        else
-          self.index = i3
-          r3 = ParseFailure.new(input, i3)
-        end
-        if r3.success?
-          r0 = r3
-        else
-          self.index = i0
-          r0 = ParseFailure.new(input, i0)
-        end
-      end
-    end
-    
-    node_cache[:primary][start_index] = r0
-    
-    return r0
-  end
-  
-  module Variable0
-    def eval(env={})
-      env[name]
-    end
-    
-    def name
-      text_value
-    end
-  end
-  
-  def _nt_variable
-    start_index = index
-    cached = node_cache[:variable][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    s0, i0 = [], index
-    loop do
-      r1 = parse_char_class(/[a-z]/, 'a-z', SyntaxNode)
-      if r1.success?
-        s0 << r1
-      else
-        break
-      end
-    end
-    if s0.empty?
-      self.index = i0
-      r0 = ParseFailure.new(input, i0)
-    else
-      r0 = SyntaxNode.new(input, i0...index, s0)
-      r0.extend(Variable0)
-    end
-    
-    node_cache[:variable][start_index] = r0
-    
-    return r0
-  end
-  
-  module Number0
-  end
-  
-  module Number1
-    def eval(env={})
-      text_value.to_i
-    end
-  end
-  
-  def _nt_number
-    start_index = index
-    cached = node_cache[:number][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    i0 = index
-    i1, s1 = index, []
-    r2 = parse_char_class(/[1-9]/, '1-9', SyntaxNode)
-    s1 << r2
-    if r2.success?
-      s3, i3 = [], index
-      loop do
-        r4 = parse_char_class(/[0-9]/, '0-9', SyntaxNode)
-        if r4.success?
-          s3 << r4
-        else
-          break
-        end
-      end
-      r3 = SyntaxNode.new(input, i3...index, s3)
-      s1 << r3
-    end
-    if s1.last.success?
-      r1 = (SyntaxNode).new(input, i1...index, s1)
-      r1.extend(Number0)
-    else
-      self.index = i1
-      r1 = ParseFailure.new(input, i1)
-    end
-    if r1.success?
-      r0 = r1
-      r0.extend(Number1)
-    else
-      r5 = parse_terminal('0', SyntaxNode)
-      if r5.success?
-        r0 = r5
-        r0.extend(Number1)
-      else
-        self.index = i0
-        r0 = ParseFailure.new(input, i0)
-      end
-    end
-    
-    node_cache[:number][start_index] = r0
-    
-    return r0
-  end
-  
-  def _nt_space
-    start_index = index
-    cached = node_cache[:space][index]
-    if cached
-      @index = cached.interval.end
-      return cached
-    end
-    
-    s0, i0 = [], index
-    loop do
-      r1 = parse_terminal(' ', SyntaxNode)
-      if r1.success?
-        s0 << r1
-      else
-        break
-      end
-    end
-    r0 = SyntaxNode.new(input, i0...index, s0)
-    
-    node_cache[:space][start_index] = r0
-    
-    return r0
-  end
-  
-end
-
-class ArithmeticParser < Treetop::Runtime::CompiledParser
-  include Arithmetic
-end