ruby-ll 2.1.1 → 2.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: a62ba595bf65ddec515dd3f1c905385e9b8bbbde
-  data.tar.gz: 08ec033a8c9ed472637b2e5a0ab2307d440dbdbe
+SHA256:
+  metadata.gz: 2e1faade684ee6c30dbceab3e16db55cd11d94a89933649d324009e1fd033f33
+  data.tar.gz: 2cbd469bbd142d904cbed8feb4557bd813744ab20cb5af9a5decc1f04eaca957
 SHA512:
-  metadata.gz: 3c17f041104af568bec2bceae1f4eda8d90519fcade58a3fa965b281538363e1954749ddf3fe086797432dac130f1284bda4fa51bf13623c0aa39d050860af4d
-  data.tar.gz: 6d4cb5330de7c551bba92e6de2f158b343168421388e8032718e006a8c7d20e3fe8121ecd7c9bfb11b96a0021c0aa24566985ccf67bacd2b0b31742bd807e14a
+  metadata.gz: 3d8910a725c85f891ca9162d7d56893cac42eee64fed9e8cd00ba565e14eb7d34f204ea90ced3b8783b1ab411fb3595fdb849780b7a5babfe4c7674be8822f26
+  data.tar.gz: f9f08de4719772842c6693dc7fde5212b2eb94d1086a673f1557d6ea97a6f8f7f6ec5403a358a4d13fe0c714cdb6518e488fd460d740b0508a9799c59ffceb74

data/LICENSE

@@ -1,19 +1,362 @@
-Copyright (c) 2015, Yorick Peterse
-
-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.
+Mozilla Public License, version 2.0
+
+1. Definitions
+
+1.1. "Contributor"
+
+     means each individual or legal entity that creates, contributes to the
+     creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+
+     means the combination of the Contributions of others (if any) used by a
+     Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+
+     means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+
+     means Source Code Form to which the initial Contributor has attached the
+     notice in Exhibit A, the Executable Form of such Source Code Form, and
+     Modifications of such Source Code Form, in each case including portions
+     thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+     means
+
+     a. that the initial Contributor has attached the notice described in
+        Exhibit B to the Covered Software; or
+
+     b. that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the terms of
+        a Secondary License.
+
+1.6. "Executable Form"
+
+     means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+
+     means a work that combines Covered Software with other material, in a
+     separate file or files, that is not Covered Software.
+
+1.8. "License"
+
+     means this document.
+
+1.9. "Licensable"
+
+     means having the right to grant, to the maximum extent possible, whether
+     at the time of the initial grant or subsequently, any and all of the
+     rights conveyed by this License.
+
+1.10. "Modifications"
+
+     means any of the following:
+
+     a. any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered Software; or
+
+     b. any new file in Source Code Form that contains any Covered Software.
+
+1.11. "Patent Claims" of a Contributor
+
+      means any patent claim(s), including without limitation, method,
+      process, and apparatus claims, in any patent Licensable by such
+      Contributor that would be infringed, but for the grant of the License,
+      by the making, using, selling, offering for sale, having made, import,
+      or transfer of either its Contributions or its Contributor Version.
+
+1.12. "Secondary License"
+
+      means either the GNU General Public License, Version 2.0, the GNU Lesser
+      General Public License, Version 2.1, the GNU Affero General Public
+      License, Version 3.0, or any later versions of those licenses.
+
+1.13. "Source Code Form"
+
+      means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+
+      means an individual or a legal entity exercising rights under this
+      License. For legal entities, "You" includes any entity that controls, is
+      controlled by, or is under common control with You. For purposes of this
+      definition, "control" means (a) the power, direct or indirect, to cause
+      the direction or management of such entity, whether by contract or
+      otherwise, or (b) ownership of more than fifty percent (50%) of the
+      outstanding shares or beneficial ownership of such entity.
+
+
+2. License Grants and Conditions
+
+2.1. Grants
+
+     Each Contributor hereby grants You a world-wide, royalty-free,
+     non-exclusive license:
+
+     a. under intellectual property rights (other than patent or trademark)
+        Licensable by such Contributor to use, reproduce, make available,
+        modify, display, perform, distribute, and otherwise exploit its
+        Contributions, either on an unmodified basis, with Modifications, or
+        as part of a Larger Work; and
+
+     b. under Patent Claims of such Contributor to make, use, sell, offer for
+        sale, have made, import, and otherwise transfer either its
+        Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+     The licenses granted in Section 2.1 with respect to any Contribution
+     become effective for each Contribution on the date the Contributor first
+     distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+     The licenses granted in this Section 2 are the only rights granted under
+     this License. No additional rights or licenses will be implied from the
+     distribution or licensing of Covered Software under this License.
+     Notwithstanding Section 2.1(b) above, no patent license is granted by a
+     Contributor:
+
+     a. for any code that a Contributor has removed from Covered Software; or
+
+     b. for infringements caused by: (i) Your and any other third party's
+        modifications of Covered Software, or (ii) the combination of its
+        Contributions with other software (except as part of its Contributor
+        Version); or
+
+     c. under Patent Claims infringed by Covered Software in the absence of
+        its Contributions.
+
+     This License does not grant any rights in the trademarks, service marks,
+     or logos of any Contributor (except as may be necessary to comply with
+     the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+     No Contributor makes additional grants as a result of Your choice to
+     distribute the Covered Software under a subsequent version of this
+     License (see Section 10.2) or under the terms of a Secondary License (if
+     permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+     Each Contributor represents that the Contributor believes its
+     Contributions are its original creation(s) or it has sufficient rights to
+     grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+     This License is not intended to limit any rights You have under
+     applicable copyright doctrines of fair use, fair dealing, or other
+     equivalents.
+
+2.7. Conditions
+
+     Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
+     Section 2.1.
+
+
+3. Responsibilities
+
+3.1. Distribution of Source Form
+
+     All distribution of Covered Software in Source Code Form, including any
+     Modifications that You create or to which You contribute, must be under
+     the terms of this License. You must inform recipients that the Source
+     Code Form of the Covered Software is governed by the terms of this
+     License, and how they can obtain a copy of this License. You may not
+     attempt to alter or restrict the recipients' rights in the Source Code
+     Form.
+
+3.2. Distribution of Executable Form
+
+     If You distribute Covered Software in Executable Form then:
+
+     a. such Covered Software must also be made available in Source Code Form,
+        as described in Section 3.1, and You must inform recipients of the
+        Executable Form how they can obtain a copy of such Source Code Form by
+        reasonable means in a timely manner, at a charge no more than the cost
+        of distribution to the recipient; and
+
+     b. You may distribute such Executable Form under the terms of this
+        License, or sublicense it under different terms, provided that the
+        license for the Executable Form does not attempt to limit or alter the
+        recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+     You may create and distribute a Larger Work under terms of Your choice,
+     provided that You also comply with the requirements of this License for
+     the Covered Software. If the Larger Work is a combination of Covered
+     Software with a work governed by one or more Secondary Licenses, and the
+     Covered Software is not Incompatible With Secondary Licenses, this
+     License permits You to additionally distribute such Covered Software
+     under the terms of such Secondary License(s), so that the recipient of
+     the Larger Work may, at their option, further distribute the Covered
+     Software under the terms of either this License or such Secondary
+     License(s).
+
+3.4. Notices
+
+     You may not remove or alter the substance of any license notices
+     (including copyright notices, patent notices, disclaimers of warranty, or
+     limitations of liability) contained within the Source Code Form of the
+     Covered Software, except that You may alter any license notices to the
+     extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+     You may choose to offer, and to charge a fee for, warranty, support,
+     indemnity or liability obligations to one or more recipients of Covered
+     Software. However, You may do so only on Your own behalf, and not on
+     behalf of any Contributor. You must make it absolutely clear that any
+     such warranty, support, indemnity, or liability obligation is offered by
+     You alone, and You hereby agree to indemnify every Contributor for any
+     liability incurred by such Contributor as a result of warranty, support,
+     indemnity or liability terms You offer. You may include additional
+     disclaimers of warranty and limitations of liability specific to any
+     jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+
+   If it is impossible for You to comply with any of the terms of this License
+   with respect to some or all of the Covered Software due to statute,
+   judicial order, or regulation then You must: (a) comply with the terms of
+   this License to the maximum extent possible; and (b) describe the
+   limitations and the code they affect. Such description must be placed in a
+   text file included with all distributions of the Covered Software under
+   this License. Except to the extent prohibited by statute or regulation,
+   such description must be sufficiently detailed for a recipient of ordinary
+   skill to be able to understand it.
+
+5. Termination
+
+5.1. The rights granted under this License will terminate automatically if You
+     fail to comply with any of its terms. However, if You become compliant,
+     then the rights granted under this License from a particular Contributor
+     are reinstated (a) provisionally, unless and until such Contributor
+     explicitly and finally terminates Your grants, and (b) on an ongoing
+     basis, if such Contributor fails to notify You of the non-compliance by
+     some reasonable means prior to 60 days after You have come back into
+     compliance. Moreover, Your grants from a particular Contributor are
+     reinstated on an ongoing basis if such Contributor notifies You of the
+     non-compliance by some reasonable means, this is the first time You have
+     received notice of non-compliance with this License from such
+     Contributor, and You become compliant prior to 30 days after Your receipt
+     of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+     infringement claim (excluding declaratory judgment actions,
+     counter-claims, and cross-claims) alleging that a Contributor Version
+     directly or indirectly infringes any patent, then the rights granted to
+     You by any and all Contributors for the Covered Software under Section
+     2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
+     license agreements (excluding distributors and resellers) which have been
+     validly granted by You or Your distributors under this License prior to
+     termination shall survive termination.
+
+6. Disclaimer of Warranty
+
+   Covered Software is provided under this License on an "as is" basis,
+   without warranty of any kind, either expressed, implied, or statutory,
+   including, without limitation, warranties that the Covered Software is free
+   of defects, merchantable, fit for a particular purpose or non-infringing.
+   The entire risk as to the quality and performance of the Covered Software
+   is with You. Should any Covered Software prove defective in any respect,
+   You (not any Contributor) assume the cost of any necessary servicing,
+   repair, or correction. This disclaimer of warranty constitutes an essential
+   part of this License. No use of  any Covered Software is authorized under
+   this License except under this disclaimer.
+
+7. Limitation of Liability
+
+   Under no circumstances and under no legal theory, whether tort (including
+   negligence), contract, or otherwise, shall any Contributor, or anyone who
+   distributes Covered Software as permitted above, be liable to You for any
+   direct, indirect, special, incidental, or consequential damages of any
+   character including, without limitation, damages for lost profits, loss of
+   goodwill, work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses, even if such party shall have been
+   informed of the possibility of such damages. This limitation of liability
+   shall not apply to liability for death or personal injury resulting from
+   such party's negligence to the extent applicable law prohibits such
+   limitation. Some jurisdictions do not allow the exclusion or limitation of
+   incidental or consequential damages, so this exclusion and limitation may
+   not apply to You.
+
+8. Litigation
+
+   Any litigation relating to this License may be brought only in the courts
+   of a jurisdiction where the defendant maintains its principal place of
+   business and such litigation shall be governed by laws of that
+   jurisdiction, without reference to its conflict-of-law provisions. Nothing
+   in this Section shall prevent a party's ability to bring cross-claims or
+   counter-claims.
+
+9. Miscellaneous
+
+   This License represents the complete agreement concerning the subject
+   matter hereof. If any provision of this License is held to be
+   unenforceable, such provision shall be reformed only to the extent
+   necessary to make it enforceable. Any law or regulation which provides that
+   the language of a contract shall be construed against the drafter shall not
+   be used to construe this License against a Contributor.
+
+
+10. Versions of the License
+
+10.1. New Versions
+
+      Mozilla Foundation is the license steward. Except as provided in Section
+      10.3, no one other than the license steward has the right to modify or
+      publish new versions of this License. Each version will be given a
+      distinguishing version number.
+
+10.2. Effect of New Versions
+
+      You may distribute the Covered Software under the terms of the version
+      of the License under which You originally received the Covered Software,
+      or under the terms of any subsequent version published by the license
+      steward.
+
+10.3. Modified Versions
+
+      If you create software not governed by this License, and you want to
+      create a new license for such software, you may create and use a
+      modified version of this License if you rename the license and remove
+      any references to the name of the license steward (except to note that
+      such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+      Licenses If You choose to distribute Source Code Form that is
+      Incompatible With Secondary Licenses under the terms of this version of
+      the License, the notice described in Exhibit B of this License must be
+      attached.
+
+Exhibit A - Source Code Form License Notice
+
+      This Source Code Form is subject to the
+      terms of the Mozilla Public License, v.
+      2.0. If a copy of the MPL was not
+      distributed with this file, You can
+      obtain one at
+      http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular file,
+then You may include the notice in a location (such as a LICENSE file in a
+relevant directory) where a recipient would be likely to look for such a
+notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+
+      This Source Code Form is "Incompatible
+      With Secondary Licenses", as defined by
+      the Mozilla Public License, v. 2.0.

data/README.md

@@ -27,20 +27,20 @@ For more information on LL parsing, see
 
 ## Requirements
 
-| Ruby     | Required      | Recommended |
-|:---------|:--------------|:------------|
-| MRI      | >= 1.9.3      | >= 2.1.0    |
-| Rubinius | >= 2.2        | >= 2.5.0    |
-| JRuby    | >= 1.7        | >= 1.7.0    |
-| Maglev   | Not supported |             |
-| Topaz    | Not supported |             |
-| mruby    | Not supported |             |
+| Ruby     | Required
+|:---------|:--------------
+| MRI      | >= 2.6.0
+| JRuby    | >= 9.0
+| Rubinius | Not supported
+| Maglev   | Not supported
+| Topaz    | Not supported
+| mruby    | Not supported
 
-For MRI/Rubinius you'll need a C90 compatible compiler such as clang or gcc. For
-JRuby you don't need any compilers to be installed as the .jar is packaged with
-the Gem itself.
+For MRI you'll need a C90 compatible compiler such as clang or gcc. For JRuby
+you don't need any compilers to be installed as the .jar is packaged with the
+Gem itself.
 
-When hacking on Oga you'll also need to have the following installed:
+When hacking on ruby-ll you'll also need to have the following installed:
 
 * Ragel 6 for building the grammar lexer
 * javac for building the JRuby extension
@@ -265,8 +265,8 @@ Code blocks can also be added:
       | B { 'B' }
       ;
 
-When the terminal `A` would be processed the returned value would be "B", for
-terminal `B` the returned value would be "B".
+When the terminal `A` would be processed the returned value would be `'A'`, for
+terminal `B` the returned value would be `'B'`.
 
 Code blocks have access to an array called `val` which contains the values of
 every step of a branch. For example:
@@ -285,7 +285,7 @@ If no explicit code block is defined then ruby-ll will generate one for you. If
 a branch consists out of only a single step (e.g. `A = B;`) then only the first
 value is returned, otherwise all values are returned.
 
-This means that in the following example the output will be whatever value "C"
+This means that in the following example the output will be whatever value `C`
 contains:
 
     A = B { p val[0] };
@@ -482,9 +482,14 @@ slight allocation overhead but it beats having to deal with race conditions.
 
 ## License
 
-All source code in this repository is licensed under the MIT license unless
-specified otherwise. A copy of this license can be found in the file "LICENSE"
-in the root directory of this repository.
+All source code in this repository is subject to the terms of the Mozilla Public
+License, version 2.0 unless stated otherwise. A copy of this license can be
+found the file "LICENSE" or at <https://www.mozilla.org/MPL/2.0/>.
+
+The following files are licensed under a different license:
+
+* ext/c/khash.h: MIT license (see source code)
+* ext/c/kvec.h: MIT license (see source code)
 
 [racc]: https://github.com/tenderlove/racc
 [oga]: https://github.com/yorickpeterse/oga

data/ext/c/extconf.rb

@@ -1,6 +1,6 @@
 require 'mkmf'
 
-if RbConfig::CONFIG['cc'] =~ /clang|gcc/
+if RbConfig::CONFIG['CC'] =~ /clang|gcc/
   $CFLAGS << ' -pedantic'
 end
 

data/lib/ll/code_generator.rb

@@ -24,7 +24,7 @@ module LL
       )
 
       template = File.read(TEMPLATE)
-      erb      = ERB.new(template, nil, '-').result(context.get_binding)
+      erb      = ERB.new(template, trim_mode: '-').result(context.get_binding)
 
       return erb
     end

data/lib/ll/lexer.rb

@@ -8,7 +8,7 @@ module LL
   #
   class Lexer
     
-# line 12 "lib/ll/lexer.rb"
+# line 9 "lib/ll/lexer.rb"
 class << self
 	attr_accessor :_ll_lexer_trans_keys
 	private :_ll_lexer_trans_keys, :_ll_lexer_trans_keys=
@@ -264,7 +264,7 @@ self.ll_lexer_en_main = 22;
       _ll_lexer_trans_targs        = self.class.send(:_ll_lexer_trans_targs)
 
       
-# line 268 "lib/ll/lexer.rb"
+# line 263 "lib/ll/lexer.rb"
 begin
 	testEof = false
 	_slen, _trans, _keys, _inds, _acts, _nacts = nil
@@ -292,7 +292,7 @@ begin
 		begin
 ts = p
 		end
-# line 296 "lib/ll/lexer.rb"
+# line 291 "lib/ll/lexer.rb"
 	end
 	_keys = cs << 1
 	_inds = _ll_lexer_index_offsets[cs]
@@ -503,7 +503,7 @@ te = p+1
 # line 168 "lib/ll/lexer.rl"
 		begin
 act = 23;		end
-# line 507 "lib/ll/lexer.rb"
+# line 502 "lib/ll/lexer.rb"
 	end
 	end
 	end
@@ -513,7 +513,7 @@ act = 23;		end
 # line 1 "NONE"
 		begin
 ts = nil;		end
-# line 517 "lib/ll/lexer.rb"
+# line 512 "lib/ll/lexer.rb"
 	end
 
 	if cs == 0

data/lib/ll/setup.rb

@@ -1,12 +1,14 @@
-require_relative 'version'
-require_relative 'driver'
-require_relative 'driver_config'
-require_relative 'parser_error'
-require_relative 'configuration_compiler'
-require_relative '../libll'
+require 'll/version'
+require 'll/driver'
+require 'll/driver_config'
+require 'll/parser_error'
+require 'll/configuration_compiler'
+require 'libll'
 
 #:nocov:
 if RUBY_PLATFORM == 'java'
+  require 'jruby'
+
   org.libll.Libll.load(JRuby.runtime)
 end
 #:nocov:

data/lib/ll/version.rb

@@ -1,3 +1,3 @@
 module LL
-  VERSION = '2.1.1'
+  VERSION = '2.1.3'
 end # LL

data/lib/ll.rb

@@ -6,22 +6,22 @@ require 'optparse'
 require 'ast'
 require 'ansi/code'
 
-require_relative 'll/setup'
-require_relative 'll/source_line'
-require_relative 'll/lexer'
-require_relative 'll/token'
-require_relative 'll/parser'
-require_relative 'll/grammar_compiler'
-require_relative 'll/code_generator'
-require_relative 'll/compiled_grammar'
-require_relative 'll/rule'
-require_relative 'll/branch'
-require_relative 'll/terminal'
-require_relative 'll/epsilon'
-require_relative 'll/operator'
-require_relative 'll/message'
-require_relative 'll/ast/node'
-require_relative 'll/erb_context'
-require_relative 'll/configuration_compiler'
-require_relative 'll/compiled_configuration'
-require_relative 'll/cli'
+require 'll/setup'
+require 'll/source_line'
+require 'll/lexer'
+require 'll/token'
+require 'll/parser'
+require 'll/grammar_compiler'
+require 'll/code_generator'
+require 'll/compiled_grammar'
+require 'll/rule'
+require 'll/branch'
+require 'll/terminal'
+require 'll/epsilon'
+require 'll/operator'
+require 'll/message'
+require 'll/ast/node'
+require 'll/erb_context'
+require 'll/configuration_compiler'
+require 'll/compiled_configuration'
+require 'll/cli'

data/ruby-ll.gemspec

@@ -4,11 +4,11 @@ Gem::Specification.new do |s|
   s.name        = 'ruby-ll'
   s.version     = LL::VERSION
   s.authors     = ['Yorick Peterse']
-  s.email       = 'yorickpeterse@gmail.com'
+  s.email       = 'yorick@yorickpeterse.com'
   s.summary     = 'An LL(1) parser generator for Ruby.'
   s.homepage    = 'https://github.com/yorickpeterse/ruby-ll'
   s.description = s.summary
-  s.license     = 'MIT'
+  s.license     = 'MPL-2.0'
 
   s.files = Dir.glob([
     'checkum/**/*',
@@ -31,9 +31,6 @@ Gem::Specification.new do |s|
     s.extensions = ['ext/c/extconf.rb']
   end
 
-  s.has_rdoc              = 'yard'
-  s.required_ruby_version = '>= 1.9.3'
-
   s.add_dependency 'ast'
   s.add_dependency 'ansi'
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby-ll
 version: !ruby/object:Gem::Version
-  version: 2.1.1
+  version: 2.1.3
 platform: ruby
 authors:
 - Yorick Peterse
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2015-03-22 00:00:00.000000000 Z
+date: 2023-06-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: ast
@@ -137,7 +137,7 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '0'
 description: An LL(1) parser generator for Ruby.
-email: yorickpeterse@gmail.com
+email: yorick@yorickpeterse.com
 executables:
 - ruby-ll
 extensions:
@@ -148,7 +148,6 @@ files:
 - LICENSE
 - README.md
 - bin/ruby-ll
-- doc/DCO.md
 - doc/css/common.css
 - doc/driver_architecture.md
 - ext/c/driver.c
@@ -166,7 +165,6 @@ files:
 - ext/java/org/libll/DriverConfig.java
 - lib/ll.rb
 - lib/ll/ast/node.rb
-- lib/ll/bootstrap/parser.rb
 - lib/ll/branch.rb
 - lib/ll/cli.rb
 - lib/ll/code_generator.rb
@@ -193,9 +191,9 @@ files:
 - ruby-ll.gemspec
 homepage: https://github.com/yorickpeterse/ruby-ll
 licenses:
-- MIT
+- MPL-2.0
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -203,17 +201,15 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 1.9.3
+      version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.4.5
-signing_key: 
+rubygems_version: 3.4.8
+signing_key:
 specification_version: 4
 summary: An LL(1) parser generator for Ruby.
 test_files: []
-has_rdoc: yard

data/doc/DCO.md

@@ -1,25 +0,0 @@
-# Developer's Certificate of Origin 1.0
-
-By making a contribution to this project, I certify that:
-
-1. The contribution was created in whole or in part by me and I
-   have the right to submit it under the open source license
-   indicated in the file LICENSE; or
-
-2. The contribution is based upon previous work that, to the best
-   of my knowledge, is covered under an appropriate open source
-   license and I have the right under that license to submit that
-   work with modifications, whether created in whole or in part
-   by me, under the same open source license (unless I am
-   permitted to submit under a different license), as indicated
-   in the file LICENSE; or
-
-3. The contribution was provided directly to me by some other
-   person who certified (1), (2) or (3) and I have not modified
-   it.
-
-4. I understand and agree that this project and the contribution
-   are public and that a record of the contribution (including all
-   personal information I submit with it, including my sign-off) is
-   maintained indefinitely and may be redistributed consistent with
-   this project or the open source license(s) involved.

data/lib/ll/bootstrap/parser.rb

@@ -1,326 +0,0 @@
-#
-# DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.4.12
-# from Racc grammer file "".
-#
-
-require 'racc/parser.rb'
-module LL
-  module Bootstrap
-    class Parser < Racc::Parser
-
-  ##
-  # @see [LL::Lexer#initialize]
-  #
-  def initialize(*args)
-    @lexer = Lexer.new(*args)
-  end
-
-  ##
-  # Yields the next token from the lexer.
-  #
-  # @yieldparam [Array]
-  #
-  def yield_next_token
-    @lexer.advance do |token|
-      yield [token.type, token]
-    end
-
-    yield [false, false]
-  end
-
-  ##
-  # @see [LL::AST::Node#initialize]
-  # @return [LL::AST::Node]
-  #
-  def s(*args)
-    return AST::Node.new(*args)
-  end
-
-  ##
-  # Parses the input and returns the corresponding AST.
-  #
-  # @return [LL::AST::Node]
-  #
-  def parse
-    return yyparse(self, :yield_next_token)
-  end
-
-# vim: set ft=racc:
-##### State transition tables begin ###
-
-racc_action_table = [
-    14,    28,    16,    14,    26,    29,    10,    11,    12,    13,
-    14,    10,    11,    12,    13,    14,    14,    14,    14,    22,
-    33,    33,    22,    24,    25,    37,    38,    14,    22,    40,
-    41,    14,    28 ]
-
-racc_action_check = [
-    19,    18,     1,    10,    18,    19,     0,     0,     0,     0,
-     0,     2,     2,     2,     2,     2,    24,    40,    11,    12,
-    24,    40,    13,    15,    16,    27,    28,    31,    34,    35,
-    36,    38,    42 ]
-
-racc_action_pointer = [
-     3,     2,     8,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-    -4,    11,    17,    20,   nil,    15,    24,   nil,    -8,    -7,
-   nil,   nil,   nil,   nil,     9,   nil,   nil,    13,    17,   nil,
-   nil,    20,   nil,   nil,    26,    19,    18,   nil,    24,   nil,
-    10,   nil,    23,   nil,   nil ]
-
-racc_action_default = [
-    -2,   -30,    -1,    -4,    -5,    -6,    -7,    -8,    -9,   -10,
-   -30,   -30,   -30,   -30,   -20,   -30,   -30,    -3,   -30,   -30,
-   -18,   -16,   -29,   -17,   -30,    45,   -11,   -30,   -30,   -15,
-   -19,   -21,   -22,   -23,   -24,   -26,   -30,   -12,   -30,   -25,
-   -30,   -28,   -13,   -27,   -14 ]
-
-racc_goto_table = [
-    15,    27,    15,     1,    21,    23,    36,     3,     2,    17,
-    18,    19,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    30,
-   nil,   nil,    43,   nil,   nil,    44,    39,   nil,   nil,   nil,
-   nil,    30,   nil,   nil,   nil,   nil,   nil,   nil,    42 ]
-
-racc_goto_check = [
-    10,    11,    10,     1,    13,    13,    17,     3,     2,     3,
-    10,    12,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    10,
-   nil,   nil,    17,   nil,   nil,    11,    13,   nil,   nil,   nil,
-   nil,    10,   nil,   nil,   nil,   nil,   nil,   nil,    10 ]
-
-racc_goto_pointer = [
-   nil,     3,     8,     7,   nil,   nil,   nil,   nil,   nil,   nil,
-     0,   -17,     0,    -8,   nil,   nil,   nil,   -18 ]
-
-racc_goto_default = [
-   nil,   nil,   nil,   nil,     4,     5,     6,     7,     8,     9,
-    20,   nil,    31,   nil,    34,    32,    35,   nil ]
-
-racc_reduce_table = [
-  0, 0, :racc_error,
-  1, 14, :_reduce_1,
-  0, 14, :_reduce_2,
-  2, 15, :_reduce_3,
-  1, 15, :_reduce_4,
-  1, 16, :_reduce_none,
-  1, 16, :_reduce_none,
-  1, 17, :_reduce_none,
-  1, 17, :_reduce_none,
-  1, 17, :_reduce_none,
-  1, 17, :_reduce_none,
-  3, 19, :_reduce_11,
-  4, 19, :_reduce_12,
-  3, 24, :_reduce_13,
-  4, 24, :_reduce_14,
-  3, 20, :_reduce_15,
-  2, 21, :_reduce_16,
-  2, 22, :_reduce_17,
-  1, 25, :_reduce_18,
-  2, 25, :_reduce_19,
-  1, 23, :_reduce_20,
-  1, 27, :_reduce_21,
-  1, 27, :_reduce_22,
-  1, 28, :_reduce_23,
-  1, 29, :_reduce_24,
-  2, 29, :_reduce_25,
-  1, 30, :_reduce_26,
-  3, 30, :_reduce_27,
-  4, 18, :_reduce_28,
-  1, 26, :_reduce_29 ]
-
-racc_reduce_n = 30
-
-racc_shift_n = 45
-
-racc_token_table = {
-  false => 0,
-  :error => 1,
-  :T_RUBY => 2,
-  :T_NAME => 3,
-  :T_TERMINALS => 4,
-  :T_INNER => 5,
-  :T_HEADER => 6,
-  :T_IDENT => 7,
-  :T_EQUALS => 8,
-  :T_COLON => 9,
-  :T_PIPE => 10,
-  :T_EPSILON => 11,
-  :T_SEMICOLON => 12 }
-
-racc_nt_base = 13
-
-racc_use_result_var = false
-
-Racc_arg = [
-  racc_action_table,
-  racc_action_check,
-  racc_action_default,
-  racc_action_pointer,
-  racc_goto_table,
-  racc_goto_check,
-  racc_goto_default,
-  racc_goto_pointer,
-  racc_nt_base,
-  racc_reduce_table,
-  racc_token_table,
-  racc_shift_n,
-  racc_reduce_n,
-  racc_use_result_var ]
-
-Racc_token_to_s_table = [
-  "$end",
-  "error",
-  "T_RUBY",
-  "T_NAME",
-  "T_TERMINALS",
-  "T_INNER",
-  "T_HEADER",
-  "T_IDENT",
-  "T_EQUALS",
-  "T_COLON",
-  "T_PIPE",
-  "T_EPSILON",
-  "T_SEMICOLON",
-  "$start",
-  "grammar",
-  "elements",
-  "element",
-  "directive",
-  "rule",
-  "name",
-  "terminals",
-  "inner",
-  "header",
-  "ident",
-  "name_ns",
-  "idents",
-  "ruby",
-  "idents_or_epsilon",
-  "epsilon",
-  "branch",
-  "branches" ]
-
-Racc_debug_parser = false
-
-##### State transition tables end #####
-
-# reduce 0 omitted
-
-def _reduce_1(val, _values)
- s(:grammar, val[0]) 
-end
-
-def _reduce_2(val, _values)
- s(:grammar) 
-end
-
-def _reduce_3(val, _values)
- val[0] << val[1] 
-end
-
-def _reduce_4(val, _values)
- val 
-end
-
-# reduce 5 omitted
-
-# reduce 6 omitted
-
-# reduce 7 omitted
-
-# reduce 8 omitted
-
-# reduce 9 omitted
-
-# reduce 10 omitted
-
-def _reduce_11(val, _values)
-        s(:name, [val[1]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_12(val, _values)
-        s(:name, [val[1], *val[2]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_13(val, _values)
- [val[2]] 
-end
-
-def _reduce_14(val, _values)
- [val[2]] + val[3] 
-end
-
-def _reduce_15(val, _values)
-        s(:terminals, val[1], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_16(val, _values)
- s(:inner, [val[1]], :source_line => val[0].source_line) 
-end
-
-def _reduce_17(val, _values)
- s(:header, [val[1]], :source_line => val[0].source_line) 
-end
-
-def _reduce_18(val, _values)
- val 
-end
-
-def _reduce_19(val, _values)
- val[0] << val[1] 
-end
-
-def _reduce_20(val, _values)
- s(:ident, [val[0].value], :source_line => val[0].source_line) 
-end
-
-def _reduce_21(val, _values)
-        s(:steps, val[0], :source_line => val[0][0].source_line)
-      
-end
-
-def _reduce_22(val, _values)
-        s(:steps, [val[0]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_23(val, _values)
- s(:epsilon, [], :source_line => val[0].source_line) 
-end
-
-def _reduce_24(val, _values)
-        s(:branch, [val[0]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_25(val, _values)
-        s(:branch, [val[0], val[1]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_26(val, _values)
- val 
-end
-
-def _reduce_27(val, _values)
- [val[0]] + val[2] 
-end
-
-def _reduce_28(val, _values)
-        s(:rule, [val[0], *val[2]], :source_line => val[0].source_line)
-      
-end
-
-def _reduce_29(val, _values)
- s(:ruby, [val[0].value], :source_line => val[0].source_line) 
-end
-
-def _reduce_none(val, _values)
-  val[0]
-end
-
-    end   # class Parser
-    end   # module Bootstrap
-  end   # module LL