less 0.8.13 → 1.0.4

data/lib/vendor/treetop/.gitignore

@@ -0,0 +1,7 @@
+*.gem
+*.iml
+*.iws
+*.ipr
+doc/site/*.*
+benchmark/*.dat
+benchmark/*.log

data/lib/vendor/treetop/LICENSE

@@ -0,0 +1,19 @@
+Copyright (c) 2007 Nathan Sobo.
+
+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.

data/lib/vendor/treetop/README

@@ -0,0 +1,164 @@
+Tutorial
+========
+Languages can be split into two components, their *syntax* and their *semantics*. It's your understanding of English syntax that tells you the stream of words "Sleep furiously green ideas colorless" is not a valid sentence. Semantics is deeper. Even if we rearrange the above sentence to be "Colorless green ideas sleep furiously", which is syntactically correct, it remains nonsensical on a semantic level. With Treetop, you'll be dealing with languages that are much simpler than English, but these basic concepts apply. Your programs will need to address both the syntax and the semantics of the languages they interpret.
+
+Treetop equips you with powerful tools for each of these two aspects of interpreter writing. You'll describe the syntax of your language with a *parsing expression grammar*. From this description, Treetop will generate a Ruby parser that transforms streams of characters written into your language into *abstract syntax trees* representing their structure. You'll then describe the semantics of your language in Ruby by defining methods on the syntax trees the parser generates.
+
+Parsing Expression Grammars, The Basics
+=======================================
+The first step in using Treetop is defining a grammar in a file with the `.treetop` extension. Here's a grammar that's useless because it's empty:
+    
+    # my_grammar.treetop
+    grammar MyGrammar
+    end
+
+Next, you start filling your grammar with rules. Each rule associates a name with a parsing expression, like the following:
+
+    # my_grammar.treetop
+    # You can use a .tt extension instead if you wish
+    grammar MyGrammar
+      rule hello
+        'hello chomsky'
+      end
+    end
+
+The first rule becomes the *root* of the grammar, causing its expression to be matched when a parser for the grammar is fed a string. The above grammar can now be used in a Ruby program. Notice how a string matching the first rule parses successfully, but a second nonmatching string does not.
+
+    # use_grammar.rb
+    require 'rubygems'
+    require 'treetop'
+    Treetop.load 'my_grammar'
+    # or just:
+    # require 'my_grammar'                     # This works because Polyglot hooks "require" to find and load Treetop files
+    
+    parser = MyGrammarParser.new
+    puts parser.parse('hello chomsky')         # => Treetop::Runtime::SyntaxNode
+    puts parser.parse('silly generativists!')  # => nil
+
+Users of *regular expressions* will find parsing expressions familiar. They share the same basic purpose, matching strings against patterns. However, parsing expressions can recognize a broader category of languages than their less expressive brethren. Before we get into demonstrating that, lets cover some basics. At first parsing expressions won't seem much different. Trust that they are.
+
+Terminal Symbols
+----------------
+The expression in the grammar above is a terminal symbol. It will only match a string that matches it exactly. There are two other kinds of terminal symbols, which we'll revisit later. Terminals are called *atomic expressions* because they aren't composed of smaller expressions.
+
+Ordered Choices
+---------------
+Ordered choices are *composite expressions*, which allow for any of several subexpressions to be matched. These should be familiar from regular expressions, but in parsing expressions, they are delimited by the `/` character. Its important to note that the choices are prioritized in the order they appear. If an earlier expression is matched, no subsequent expressions are tried. Here's an example:
+
+    # my_grammar.treetop
+    grammar MyGrammar
+      rule hello
+        'hello chomsky' / 'hello lambek'
+      end
+    end
+    
+    # fragment of use_grammar.rb
+    puts parser.parse('hello chomsky')         # => Treetop::Runtime::SyntaxNode
+    puts parser.parse('hello lambek')          # => Treetop::Runtime::SyntaxNode
+    puts parser.parse('silly generativists!')  # => nil
+
+Note that once a choice rule has matched the text using a particular alternative at a particular location in the input and hence has succeeded, that choice will never be reconsidered, even if the chosen alternative causes another rule to fail where a later alternative wouldn't have. It's always a later alternative, since the first to succeed is final - why keep looking when you've found what you wanted? This is a feature of PEG parsers that you need to understand if you're going to succeed in using Treetop. In order to memoize success and failures, such decisions cannot be reversed. Luckily Treetop provides a variety of clever ways you can tell it to avoid making the wrong decisions. But more on that later.
+
+Sequences
+---------
+Sequences are composed of other parsing expressions separated by spaces. Using sequences, we can tighten up the above grammar.
+
+    # my_grammar.treetop
+    grammar MyGrammar
+      rule hello
+        'hello ' ('chomsky' / 'lambek')
+      end
+    end
+
+Note the use of parentheses to override the default precedence rules, which bind sequences more tightly than choices.
+
+Once the whole sequence has been matched, the result is memoized and the details of the match will not be reconsidered for that location in the input.
+
+Nonterminal Symbols
+-------------------
+Here we leave regular expressions behind. Nonterminals allow expressions to refer to other expressions by name. A trivial use of this facility would allow us to make the above grammar more readable should the list of names grow longer.
+
+    # my_grammar.treetop
+    grammar MyGrammar
+      rule hello
+        'hello ' linguist
+      end
+      
+      rule linguist
+        'chomsky' / 'lambek' / 'jacobsen' / 'frege'
+      end
+    end
+
+The true power of this facility, however, is unleashed when writing *recursive expressions*. Here is a self-referential expression that can match any number of open parentheses followed by any number of closed parentheses. This is theoretically impossible with regular expressions due to the *pumping lemma*.
+
+    # parentheses.treetop
+    grammar Parentheses
+      rule parens
+        '(' parens ')' / ''
+      end
+    end
+
+
+The `parens` expression simply states that a `parens` is a set of parentheses surrounding another `parens` expression or, if that doesn't match, the empty string. If you are uncomfortable with recursion, its time to get comfortable, because it is the basis of language. Here's a tip: Don't try and imagine the parser circling round and round through the same rule. Instead, imagine the rule is *already* defined while you are defining it. If you imagine that `parens` already matches a string of matching parentheses, then its easy to think of `parens` as an open and closing parentheses around another set of matching parentheses, which conveniently, you happen to be defining. You know that `parens` is supposed to represent a string of matched parentheses, so trust in that meaning, even if you haven't fully implemented it yet.
+
+Repetition
+----------
+Any item in a rule may be followed by a '+' or a '*' character, signifying one-or-more and zero-or-more occurrences of that item. Beware though; the match is greedy, and if it matches too many items and causes subsequent items in the sequence to fail, the number matched will never be reconsidered. Here's a simple example of a rule that will never succeed:
+
+    # toogreedy.treetop
+    grammar TooGreedy
+      rule a_s
+      	'a'* 'a'
+      end
+    end
+
+The 'a'* will always eat up any 'a's that follow, and the subsequent 'a' will find none there, so the whole rule will fail. You might need to use lookahead to avoid matching too much.
+
+Negative Lookahead
+------------------
+
+When you need to ensure that the following item *doesn't* match in some case where it might otherwise, you can use negat!ve lookahead, which is an item preceeded by a ! - here's an example:
+
+    # postcondition.treetop
+    grammar PostCondition
+      rule conditional_sentence
+        ( !conditional_keyword word )+ conditional_keyword [ \t]+ word*
+      end
+
+      rule word
+        ([a-zA-Z]+ [ \t]+) 
+      end
+
+      rule conditional_keyword
+        'if' / 'while' / 'until'
+      end
+    end
+
+Even though the rule `word` would match any of the conditional keywords, the first words of a conditional_sentence must not be conditional_keywords. The negative lookahead prevents that matching, and prevents the repetition from matching too much input. Note that the lookahead may be a grammar rule of any complexity, including one that isn't used elsewhere in your grammar.
+
+Positive lookahead
+------------------
+
+Sometimes you want an item to match, but only if the *following* text would match some pattern. You don't want to consume that following text, but if it's not there, you want this rule to fail. You can append a positive lookahead like this to a rule by appending the lookahead rule preceeded by an & character.
+
+
+
+Features to cover in the talk
+=============================
+
+* Treetop files
+* Grammar definition
+* Rules
+* Loading a grammar
+* Compiling a grammar with the `tt` command
+* Accessing a parser for the grammar from Ruby
+* Parsing Expressions of all kinds
+? Left recursion and factorization
+  - Here I can talk about function application, discussing how the operator
+    could be an arbitrary expression
+* Inline node class eval blocks
+* Node class declarations
+* Labels
+* Use of super within within labels
+* Grammar composition with include
+* Use of super with grammar composition

data/lib/vendor/treetop/Rakefile

@@ -0,0 +1,19 @@
+dir = File.dirname(__FILE__)
+require 'rubygems'
+require 'rake'
+$LOAD_PATH.unshift(File.join(dir, 'vendor', 'rspec', 'lib'))
+require 'spec/rake/spectask'
+
+require 'rake/gempackagetask'
+
+task :default => :spec
+
+Spec::Rake::SpecTask.new do |t|
+  t.pattern = 'spec/**/*spec.rb'
+end
+
+load "./treetop.gemspec"
+
+Rake::GemPackageTask.new($gemspec) do |pkg|
+  pkg.need_tar = true
+end

data/lib/vendor/treetop/benchmark/seqpar.gnuplot

@@ -0,0 +1,15 @@
+f1(x) = a*x
+a = 0.5
+fit f1(x) 'before.dat' using 1:2 via a
+ 
+f2(x) = b*x
+b = 0.5
+fit f2(x) 'after.dat' using 1:2 via b
+ 
+set xlabel "Length of input"
+set ylabel "CPU time to parse"
+
+plot a*x        title 'a*x (Before)',\
+     b*x        title 'b*x (After)',\
+     "before.dat" using 1:2 title 'Before', \
+     "after.dat" using 1:2 title 'After'

data/lib/vendor/treetop/benchmark/seqpar.treetop

@@ -0,0 +1,16 @@
+grammar SeqPar
+ 
+  rule statement
+      'par ' (statement ' ')+ 'end'
+    / 'sequence' ' ' (statement ' ')+ 'end'
+    / 'seq' ' ' (statement ' ')+ 'end'
+    / ('fit' [\s] (statement ' ')+ 'end') {
+      def foo
+        "foo"
+      end
+    }
+    / 'art'+ [ ] (statement ' ')+ 'end'
+    / [A-Z] [a-zA-z0-9]*
+  end
+ 
+end

data/lib/vendor/treetop/benchmark/seqpar_benchmark.rb

@@ -0,0 +1,107 @@
+# Benchmarking written by Bernard Lambeau, improved by Jason Garber
+#
+# To test your optimizations:
+#   1. Run ruby seqpar_benchmark.rb
+#   2. cp after.dat before.dat 
+#   3. Make your modifications to the treetop code
+#   4. Run ruby seqpar_benchmark.rb
+#   5. Run gnuplot seqpar.gnuplot
+#
+$LOAD_PATH << File.join(File.dirname(__FILE__), '..', 'lib')
+require 'treetop'
+require 'benchmark'
+
+srand(47562) # So it runs the same each time
+
+class Array; def sum; inject( nil ) { |sum,x| sum ? sum+x : x }; end; end
+class Array; def mean; sum / size; end; end
+
+class SeqParBenchmark
+  
+  OPERATORS = ["seq", "fit", "art"*5, "par", "sequence"]
+  
+  # Loads the grammar and returns a parser
+  def initialize
+    compiler = Treetop::Compiler::GrammarCompiler.new
+    @where = File.expand_path(File.dirname(__FILE__))
+    grammar = File.join(@where, 'seqpar.treetop')
+    output = File.join(@where, 'seqpar.rb')
+    compiler.compile(grammar, output)
+    load output
+    File.delete(output)
+    @parser = SeqParParser.new
+  end
+  
+  # Checks the grammar
+  def check
+    ["Task",
+     "seq Task end",
+     "par Task end",
+     "seq Task Task end",
+     "par Task Task end",
+     "par seq Task end Task end",
+     "par seq seq Task end end Task end",
+     "seq Task par seq Task end Task end Task end"].each do |input|
+      raise ParseError.new(@parser) if @parser.parse(input).nil?
+    end
+  end
+  
+  # Generates an input text
+  def generate(depth=0)
+    return "Task" if depth>7
+    return "seq #{generate(depth+1)} end" if depth==0
+    which = rand(OPERATORS.length)
+    case which
+      when 0
+        "Task"
+      else
+        raise unless OPERATORS[which]
+        buffer = "#{OPERATORS[which]} "
+        0.upto(rand(4)+1) do 
+          buffer << generate(depth+1) << " "
+        end
+        buffer << "end"
+        buffer
+    end
+  end
+  
+  # Launches benchmarking
+  def benchmark
+    number_by_size = Hash.new {|h,k| h[k] = 0}
+    time_by_size = Hash.new {|h,k| h[k] = 0}
+    0.upto(250) do |i|
+      input = generate
+      length = input.length
+      puts "Launching #{i}: #{input.length}"
+      # puts input
+      tms = Benchmark.measure { @parser.parse(input) }
+      number_by_size[length] += 1
+      time_by_size[length] += tms.total*1000
+    end
+    # puts number_by_size.inspect
+    # puts time_by_size.inspect
+    
+    File.open(File.join(@where, 'after.dat'), 'w') do |dat|
+      number_by_size.keys.sort.each do |size|
+        dat << "#{size} #{(time_by_size[size]/number_by_size[size]).truncate}\n"
+      end
+    end
+    
+    if File.exists?(File.join(@where, 'before.dat'))
+      before = {}
+      performance_increases = []
+      File.foreach(File.join(@where, 'before.dat')) do |line|
+        size, time = line.split(' ')
+        before[size] = time
+      end
+      File.foreach(File.join(@where, 'after.dat')) do |line|
+        size, time = line.split(' ')
+        performance_increases << (before[size].to_f - time.to_f) / before[size].to_f unless time == "0"
+      end
+      puts "Average performance increase: #{performance_increases.mean * 100}%"
+    end
+  end
+  
+end
+
+SeqParBenchmark.new.benchmark

data/lib/vendor/treetop/bin/tt

@@ -0,0 +1,28 @@
+#!/usr/bin/env ruby
+require 'rubygems'
+gem 'treetop'
+
+$LOAD_PATH.unshift(File.expand_path(File.dirname(__FILE__) + "/../lib"))
+require 'treetop'
+
+if ARGV.empty?
+  puts "Usage:\n\ntt foo.treetop bar.treetop ...\n or\ntt foo.treetop -o alternate_name.rb\n\n"
+  exit
+end
+
+compiler = Treetop::Compiler::GrammarCompiler.new
+
+while !ARGV.empty?
+  treetop_file = ARGV.shift
+  if !File.exist?(treetop_file)
+    puts "Error: file '#{treetop_file}' doesn't exist\n\n"
+    exit(2) 
+  end
+  if ARGV.size >= 2 && ARGV[1] == '-o'
+    ARGV.shift	  # explicit output file name option
+    compiler.compile(treetop_file, ARGV.shift)
+  else
+    # list of input files option
+    compiler.compile(treetop_file)
+  end
+end

data/lib/vendor/treetop/lib/treetop.rb

@@ -0,0 +1,8 @@
+require 'rubygems'
+
+dir = File.dirname(__FILE__)
+
+TREETOP_ROOT = File.join(dir, 'treetop')
+require File.join(TREETOP_ROOT, "ruby_extensions")
+require File.join(TREETOP_ROOT, "runtime")
+require File.join(TREETOP_ROOT, "compiler")

data/lib/vendor/treetop/lib/treetop/bootstrap_gen_1_metagrammar.rb

@@ -0,0 +1,45 @@
+# This file's job is to load a Treetop::Compiler::Metagrammar and Treetop::Compiler::MetagrammarParser
+# into the environment by compiling the current metagrammar.treetop using a trusted version of Treetop.
+
+require 'rubygems'
+dir = File.dirname(__FILE__)
+
+TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP = '>= 1.1.5'
+
+# Loading trusted version of Treetop to compile the compiler
+gem_spec = Gem.source_index.find_name('treetop', TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP).last
+raise "Install a Treetop Gem version #{TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP} to bootstrap." unless gem_spec
+trusted_treetop_path = gem_spec.full_gem_path
+require File.join(trusted_treetop_path, 'lib', 'treetop')
+
+# Relocating trusted version of Treetop to Trusted::Treetop
+Trusted = Module.new
+Trusted::Treetop = Treetop
+Object.send(:remove_const, :Treetop)
+Object.send(:remove_const, :TREETOP_ROOT)
+
+# Requiring version of Treetop that is under test
+$exclude_metagrammar = true
+require File.expand_path(File.join(dir, '..', 'treetop'))
+
+# Compile and evaluate freshly generated metagrammar source
+METAGRAMMAR_PATH = File.join(TREETOP_ROOT, 'compiler', 'metagrammar.treetop')
+compiled_metagrammar_source = Trusted::Treetop::Compiler::GrammarCompiler.new.ruby_source(METAGRAMMAR_PATH)
+Object.class_eval(compiled_metagrammar_source)
+
+# The compiler under test was compiled with the trusted grammar and therefore depends on its runtime
+# But the runtime in the global namespace is the new runtime. We therefore inject the trusted runtime
+# into the compiler so its parser functions correctly. It will still not work for custom classes that
+# explicitly subclass the wrong runtime. For now I am working around this by keeping 1 generation of
+# backward compatibility in these cases.
+# Treetop::Compiler::Metagrammar.module_eval do
+#   include Trusted::Treetop::Runtime
+# end
+# 
+# Treetop::Compiler.send(:remove_const, :MetagrammarParser)
+# class Treetop::Compiler::MetagrammarParser < Trusted::Treetop::Runtime::CompiledParser
+#   include Treetop::Compiler::Metagrammar
+#   include Trusted::Treetop::Runtime
+# end
+
+$bootstrapped_gen_1_metagrammar = true

data/lib/vendor/treetop/lib/treetop/compiler.rb

@@ -0,0 +1,6 @@
+dir = File.dirname(__FILE__)
+require File.join(dir, *%w[compiler lexical_address_space])
+require File.join(dir, *%w[compiler ruby_builder])
+require File.join(dir, *%w[compiler node_classes])
+require File.join(dir, *%w[compiler metagrammar]) unless $exclude_metagrammar
+require File.join(dir, *%w[compiler grammar_compiler])