waxeye 0.4.0

data/LICENSE

@@ -0,0 +1,21 @@
+Waxeye Parser Generator
+www.waxeye.org
+Copyright (C) 2008 Orlando D. A. R. Hill
+
+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/README

@@ -0,0 +1,116 @@
+
+============================================
+| Waxeye Parser Generator                  |
+| v 0.4.0                                  |
+| www.waxeye.org                           |
+| Copyright (C) 2008 Orlando D. A. R. Hill |
+============================================
+
+
+What is Waxeye?
+===============
+
+Waxeye makes language development easy and fun. With Waxeye, you can rapidly
+explore ideas for the syntax of your language.
+
+Whether you are creating a full programming language, a domain-specific
+language or just a simple data format, Waxeye will get you there faster.
+
+
+Features
+========
+
+* Scanner-less Parsing
+
+* Language Independent, Reusable Grammars
+
+* Modular, Composable Grammars
+
+* Grammar Testing
+
+* Automatic AST Generation
+
+* Choice of Programming Language
+  - Java
+  - Ruby
+  - Scheme
+
+
+User Manual
+===========
+
+Waxeye's user manual is in 'docs/manual.html' and 'docs/manual.pdf'.
+The latest version is also online at http://waxeye.org/manual.html.
+
+
+Installation
+============
+
+Unix, OSX:
+1. Extract the files of the distribution.
+
+2. Copy the 'waxeye' directory to where you wish to install it.
+
+3. Add the 'bin/waxeye' binary to your search path. e.g. If you have '~/bin' in
+   your PATH and installed waxeye to '/usr/local/waxeye' then you might do the
+   following. ln -s /usr/local/waxeye/bin/waxeye ~/bin/
+
+
+Windows:
+1. Extract the files of the distribution.
+
+2. Copy the 'waxeye' directory to where you wish to install it.
+
+
+Building
+========
+
+1. Install MzScheme v372; either with DrScheme or alone.
+   http://download.plt-scheme.org
+
+2. Install Waxeye's backend for PLT Scheme.
+Unix, OSX:
+   sudo ln -s /usr/local/waxeye/src/scheme/waxeye /usr/local/plt/lib/plt/collects/
+
+Windows:
+   Copy the dir 'src/scheme/waxeye' into your PLT-Scheme collections directory.
+
+3. Build Waxeye
+Unix, OSX:
+   ./build/unix
+
+Windows:
+   TODO: Translate 'build/unix' to a Windows equivalent.
+
+
+Running
+=======
+
+Unix, OSX:
+Use 'waxeye'.
+
+Windows:
+Use a command prompt to run `waxeye.exe`.
+
+
+License
+=======
+
+MIT/X11 - All files (except the user manual) are under the permissive MIT/X11
+license.
+
+GNU FDL - Waxeye's user manual is under the GNU Free Documentation License.
+This includes all files in the 'doc/book' directory, 'doc/manual.html' and
+'doc/manual.pdf'.
+
+
+Support
+=======
+
+Feel free to contact me, if you are having trouble or want to give feedback.
+
+Either email me directly:
+orlandodarhill at Gmail.com
+
+Or signup and post on the mailing list:
+https://lists.sourceforge.net/lists/listinfo/waxeye-users

data/lib/waxeye.rb

@@ -0,0 +1,328 @@
+# Waxeye Parser Generator
+# www.waxeye.org
+# Copyright (C) 2008 Orlando D. A. R. Hill
+#
+# 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.
+
+
+module Waxeye
+
+  class Edge
+    attr_reader :trans, :state, :voided
+    def initialize(trans, state, voided)
+      @trans = trans
+      @state = state
+      @voided = voided
+    end
+  end
+
+  class State
+    attr_reader :edges, :match
+    def initialize(edges, match)
+      @edges = edges
+      @match = match
+    end
+  end
+
+  class Automaton
+    attr_reader :type, :states, :voided
+    def initialize(type, states, voided)
+      @type = type
+      @states = states
+      @voided = voided
+    end
+  end
+
+  class ParseError
+    attr_reader :pos, :line, :col
+    def initialize(pos, line, col)
+      @pos = pos
+      @line = line
+      @col = col
+    end
+
+    def display()
+      print "parse error at pos=#{pos}, line=#{line}, col=#{col}\n"
+    end
+  end
+
+  class AST
+    attr_reader :type, :children, :pos
+    def initialize(type, children, pos)
+      @type = type
+      @children = children
+      @pos = pos
+    end
+
+    def display_sexpr()
+      display_sexpr_iter(self)
+      print "\n"
+    end
+
+    def display()
+      display_iter(self, [0])
+    end
+
+    private
+    def display_sexpr_iter(ast)
+      print '('
+      print ast.type
+      ast.children.each do |a|
+        print " "
+        if a.is_a?(Waxeye::AST)
+          display_sexpr_iter(a)
+        else
+          print a
+        end
+      end
+      print ')'
+    end
+
+    def display_iter(ast, indent)
+      (indent[0] - 1).times {|| print '    ' }
+      print '->  ' if indent[0] > 0
+      print ast.type, "\n"
+      indent[0] = indent[0] + 1
+      ast.children.each do |a|
+        if a.is_a?(Waxeye::AST)
+          display_iter(a, indent)
+        else
+          (indent[0] - 1).times {|| print '    ' }
+          print '|   ' if indent[0] > 0
+          print a, "\n"
+        end
+      end
+      indent[0] = indent[0] - 1
+    end
+  end
+
+  class WaxeyeParser
+    def initialize(start, eof_check, line_counting, tab_width, automata)
+      @start = start
+      @eof_check = eof_check
+      @line_counting = line_counting
+      @tab_width = tab_width
+      @automata = automata
+    end
+
+    def parse(input)
+      InnerParser.new(@start, @eof_check, @line_counting, @tab_width, @automata, input).parse()
+    end
+
+    class InnerParser
+      def initialize(start, eof_check, line_counting, tab_width, automata, input)
+        @start = start
+        @eof_check = eof_check
+        @line_counting = line_counting
+        @tab_width = tab_width
+        @automata = automata
+        @states_stack = []
+        @cache = {}
+        @input = input
+        @input_len = input.length
+        @input_pos = 0
+        @line = 0
+        @column = 0
+        @last_cr = false
+        @error_pos = 0
+        @error_line = 0
+        @error_col = 0
+      end
+
+      def parse()
+        eof_check(match_automaton(@start))
+      end
+
+      private
+
+      def match_automaton(index)
+        start_pos = @input_pos
+        key = [index, start_pos]
+
+        if (@cache.has_key?(key))
+          cachedItem = @cache.fetch(key)
+          restore_pos(cachedItem[1], cachedItem[2], cachedItem[3], cachedItem[4])
+          return cachedItem[0]
+        end
+
+        start_line = @line
+        start_col = @column
+        start_cr = @last_cr
+        automaton = @automata[index]
+        type = automaton.type
+        states = automaton.states
+        voided = automaton.voided
+
+        @states_stack.push(states)
+        res = match_state(0)
+        @states_stack.pop()
+
+        value = if type == :_and
+                  restore_pos(start_pos, start_line, start_col, start_cr)
+                  not not res
+                elsif type == :_not
+                  restore_pos(start_pos, start_line, start_col, start_cr)
+                  if res
+                    update_error()
+                    false
+                  else
+                    true
+                  end
+                else
+                  if res
+                    (voided ? true : AST.new(type, res, :pos))
+                  else
+                    update_error()
+                    false
+                  end
+                end
+
+        @cache.store(key, [value, @input_pos, @line, @column, @last_cr])
+        return value
+      end
+
+      def match_state(index)
+        state = @states_stack.last[index]
+        res = match_edges(state.edges)
+        res ? res : (state.match and []) 
+      end
+
+      def match_edges(edges)
+        if edges == []
+          false
+        else
+          res = match_edge(edges[0])
+          res ? res : match_edges(edges[1..-1])
+        end
+      end
+
+      def match_edge(edge)
+        start_pos = @input_pos
+        start_line = @line
+        start_col = @column
+        start_cr = @last_cr
+        t = edge.trans
+        res = if t == :_wild
+                @input_pos < @input_len ? mv() : (update_error(); false)
+              elsif t.is_a?(String)
+                @input_pos < @input_len and t[0] == @input[@input_pos] ? mv() : (update_error(); false)
+              elsif t.is_a?(Array)
+                @input_pos < @input_len and within_set?(t, @input[@input_pos]) ? mv() : (update_error(); false)
+              elsif t.is_a?(Integer)
+                match_automaton(t)
+              else
+                false
+              end
+
+        if res
+          tran_res = match_state(edge.state)
+          if tran_res
+            if edge.voided or res == true
+              tran_res
+            else
+              [res] + tran_res
+            end
+          else
+            restore_pos(start_pos, start_line, start_col, start_cr)
+            false
+          end
+        else
+          false
+        end
+      end
+
+      def restore_pos(pos, line, col, cr)
+        @input_pos = pos
+        @line = line
+        @column = col
+        @last_cr = cr
+      end
+
+      def update_error()
+        if @error_pos < @input_pos
+          @error_pos = @input_pos
+          @error_line = @line
+          @error_col = @column
+        end
+      end
+
+      def mv()
+        ch = @input[@input_pos].chr()
+        @input_pos = @input_pos + 1
+
+        if ch == '\r'
+          @line = @line + 1
+          @column = 0
+          @last_cr = true
+        else
+          if ch == '\n'
+            if not @last_cr
+              @line = @line + 1
+              @column = 0
+            end
+          else
+            @column = @column + 1
+          end
+          @last_cr = false
+        end
+
+        return ch
+      end
+
+      def eof_check(res)
+        if res
+          if @eof_check and @input_pos < @input_len
+            # Create a parse error - Not all input consumed
+            ParseError.new(@error_pos, @error_line, @error_col)
+          else
+            res
+          end
+        else
+          # Create a parse error
+          ParseError.new(@error_pos, @error_line, @error_col)
+        end
+      end
+
+      def within_set?(set, c)
+        if set == []
+          false
+        else
+          aa = set[0]
+
+          if aa.is_a?(String)
+            if aa[0] == c
+              true
+            else
+              aa[0] < c ? within_set?(set[1..-1], c) : false
+            end
+          else
+            # If not a String then must be a range
+            if aa.include?(c)
+              true
+            else
+              aa.max < c ? within_set?(set[1..-1], c) : false
+            end
+          end
+        end
+      end
+    end
+
+  end
+
+end

metadata

@@ -0,0 +1,55 @@
+--- !ruby/object:Gem::Specification 
+name: waxeye
+version: !ruby/object:Gem::Version 
+  version: 0.4.0
+platform: ruby
+authors: 
+- Orlando D. A. R. Hill
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2008-08-07 00:00:00 +02:00
+default_executable: 
+dependencies: []
+
+description: 
+email: orlandodarhill Gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- README
+- LICENSE
+- lib/waxeye.rb
+has_rdoc: false
+homepage: http://waxeye.org
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.1.1
+signing_key: 
+specification_version: 2
+summary: The Ruby runtime for Waxeye parsers
+test_files: []
+