logical_query_parser 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e8005a57b1dd4e044f6755066a55bc40f1435e6a
-  data.tar.gz: 063e0c5f78b1ca4440203cce18769cfe90f6cde4
+  metadata.gz: 8f62acc3ca3efe725b46798c405985136dcd0702
+  data.tar.gz: 56e9d416089645c652649782a1c3d320a6bedc05
 SHA512:
-  metadata.gz: c5c6e4b62fc124139ada278d98e6a6fcd5cfb630d01d55a5bae29c578929e0628a704db17982e88173d52e59d91db1d4e0eaf7aeaa6d3563fd75315aa0d0737d
-  data.tar.gz: 37d9daf9cbbc43eb052b3e1574bd120102618cb376b851271f4ff5929573c891352473f391697857a31c977f75fa3f4a59fca7a022db277a43d2e95401ae3733
+  metadata.gz: 83df4ab258dce60d775a4d0548b4f20e25ac26d0f424fc734ea70cc579a9664ecaeaefcb3c593901629428d8954ce7ac60a3682bc32c523232c0c5de0f804ac1
+  data.tar.gz: 1ac865f2c09148e70e0da1ba31c964b53ebdf6fc31dbedb5cd602c1b5dceb74f46177ee6bb9442511ffe6679696035e9ffb287e9cf354685c873be1a6b93f69c

data/.travis.yml

@@ -1,5 +1,12 @@
 sudo: false
 language: ruby
 rvm:
-  - 2.3.1
-before_install: gem install bundler -v 1.12.5
+  - 2.3.4
+  - 2.4.1
+gemfile:
+  - gemfiles/rails42.gemfile
+  - gemfiles/rails50.gemfile
+  - gemfiles/rails51.gemfile
+before_install:
+  - gem install bundler -v 1.15.3
+script: bundle exec rspec

data/README.md

@@ -2,11 +2,11 @@
 
 A parser to generate a tree structure from a logical search query string using treetop.
 
-## Requirements
+## Dependencies
 
-* ruby 2.3 or lator
-* treetop 1.6 or lator
-* activerecord 4.2 or lator (optional)
+* ruby 2.3+
+* treetop 1.6+
+* activerecord 4.2+ (optional)
 
 ## Installation
 
@@ -28,17 +28,11 @@ Or install it yourself as:
 
 You can parse a logical query string as follows:
 
-```ruby
-parser = LogicalQueryParser.new
-parser.parse('a AND b')
-```
-
-Return value is a syntax tree of treetop:
-
 ```ruby
 parser = LogicalQueryParser.new
 parser.parse('a AND b')
 
+# return value is a syntax tree of treetop
 => SyntaxNode+Exp0+ExpNode offset=0, "a AND b" (any):
   SyntaxNode+Cond0+CondNode offset=0, "a AND b" (lexp,logic,rexp):
     SyntaxNode+Literal0+LiteralNode offset=0, "a" (word,negative):
@@ -72,16 +66,14 @@ You can also parse negative conditions:
 
 ```
 parser = LogicalQueryParser.new
-parser.parse('("a a" AND -"b b") OR (c AND -d)')
+parser.parse('("a a" AND NOT "b b") OR (c AND -d)')
 ```
 
 ### Supported operators
 
-You can parse a query string with following operators:
-
-* AND / and: represents an AND logic.
-* OR / or: represents an OR logic.
-* \-: represents a NOT logic. This should precede to a word.
+* AND / and / &: represents an AND logic.
+* OR / or / |: represents an OR logic.
+* NOT / \-: represents a NOT logic. This should precede to a word or a parenthesis.
 * (: represents beginning of a nested expression.
 * ): represents end of a nested expression.
 * ": represents beginning or end of a quoted word.

data/gemfiles/rails42.gemfile

@@ -0,0 +1,6 @@
+source 'https://rubygems.org'
+
+gem "activerecord", "~> 4.2.9"
+
+# Specify your gem's dependencies in params_keeper_rails.gemspec
+gemspec path: "../"

data/gemfiles/rails50.gemfile

@@ -0,0 +1,6 @@
+source 'https://rubygems.org'
+
+gem "activerecord", "~> 5.0.5"
+
+# Specify your gem's dependencies in params_keeper_rails.gemspec
+gemspec path: "../"

data/gemfiles/rails51.gemfile

@@ -0,0 +1,6 @@
+source 'https://rubygems.org'
+
+gem "activerecord", "~> 5.1.3"
+
+# Specify your gem's dependencies in params_keeper_rails.gemspec
+gemspec path: "../"

data/lib/logical_query.treetop

@@ -1,22 +1,22 @@
 grammar LogicalQuery
   rule exp
-    any:(cond / exp_paren / literal_seq / literal) <ExpNode>
+    sp* exp:(logic_exp / paren_exp / literal_exp / literal) sp* <ExpNode>
   end
 
-  rule exp_paren
-    lparen sp* exp sp* rparen <ExpParenNode>
+  rule logic_exp
+    lexp:(paren_exp / literal_exp / literal) logic:(and / or) rexp:exp <LogicExpNode>
   end
 
-  rule cond
-    lexp:(exp_paren / literal) sp+ logic:(land / lor) sp+ rexp:exp <CondNode>
+  rule paren_exp
+    negative:not* lparen exp rparen rexp:exp* <ParenExpNode>
   end
 
-  rule literal_seq
-    lliteral:literal sp+ rliteral:(literal_seq / literal) <LiteralSeqNode>
+  rule literal_exp
+    literal sp+ exp <LiteralExpNode>
   end
 
   rule literal
-    negative:negative* word <LiteralNode>
+    negative:not* word <LiteralNode>
   end
 
   rule word
@@ -31,14 +31,6 @@ grammar LogicalQuery
     atom+
   end
 
-  rule land
-    ('AND' / 'and') <AndNode>
-  end
-
-  rule lor
-    ('OR' / 'or') <OrNode>
-  end
-
   rule lparen
     '(' <LParenNode>
   end
@@ -47,8 +39,32 @@ grammar LogicalQuery
     ')' <RParenNode>
   end
 
-  rule negative
-    ('-' / '-' / '－') <NegativeNode>
+  rule and
+    sp+ and_ope sp+ <AndNode>
+  end
+
+  rule or
+    sp+ or_ope sp+ <OrNode>
+  end
+
+  rule not
+    (not_ope sp+ / not_sym sp*) <NotNode>
+  end
+
+  rule and_ope
+    'AND' / 'and' / '&&' / '&'
+  end
+
+  rule or_ope
+    'OR' / 'or' / '||' / '|'
+  end
+
+  rule not_ope
+    'NOT' / 'not'
+  end
+
+  rule not_sym
+    '-' / '-' / '－'
   end
 
   rule sp
@@ -56,7 +72,6 @@ grammar LogicalQuery
   end
 
   rule atom
-    !(lparen / rparen / negative / sp) .
+    !(lparen / rparen /and_ope / or_ope / not_ope / not_sym / sp) .
   end
 end
-

data/lib/logical_query_parser/nodes/active_record.rb

@@ -1,19 +1,27 @@
 module LogicalQuery
   module ExpNode
     def to_sql(opts = {}, sql = '')
-      any.to_sql(opts, sql)
+      exp.to_sql(opts, sql)
     end
   end
 
-  module ExpParenNode
+  module ParenExpNode
     def to_sql(opts, sql = '')
+      if negative.elements.size > 0
+        negative.elements[0].to_sql(opts, sql)
+      end
       lparen.to_sql(opts, sql)
       exp.to_sql(opts, sql)
       rparen.to_sql(opts, sql)
+      if rexp.elements.size > 0
+        sql += ' AND '
+        rexp.elements[0].to_sql(opts, sql)
+      end
+      sql
     end
   end
 
-  module CondNode
+  module LogicExpNode
     def to_sql(opts, sql = '')
       lexp.to_sql(opts, sql)
       logic.to_sql(opts, sql)
@@ -21,6 +29,14 @@ module LogicalQuery
     end
   end
 
+  module LiteralExpNode
+    def to_sql(opts, sql = '')
+      literal.to_sql(opts, sql)
+      sql << ' AND '
+      exp.to_sql(opts, sql)
+    end
+  end
+
   module LParenNode
     def to_sql(opts, sql = '')
       sql << '('
@@ -45,11 +61,9 @@ module LogicalQuery
     end
   end
 
-  module LiteralSeqNode
+  module NotNode
     def to_sql(opts, sql = '')
-      lliteral.to_sql(opts, sql)
-      sql << ' AND '
-      rliteral.to_sql(opts, sql)
+      sql << 'NOT '
     end
   end
 
@@ -58,9 +72,10 @@ module LogicalQuery
       operator, logic = negative.elements.size > 0 ? [:does_not_match, :and] : [:matches, :or]
       unquoted = LogicalQuery.unquote(word.text_value)
 
-      arel_table = opts[:model].arel_table
-      relations = opts[:columns].map { |c| arel_table[c].send(operator, "%#{unquoted}%") }.reduce(logic)
-      sql << relations.to_sql
+      arel = opts[:model].arel_table
+      ss = opts[:columns].map { |c| arel[c].send(operator, "%#{unquoted}%") }.reduce(logic).to_sql
+      ss = "(#{ss})" if ss[0] != '(' && ss[-1] != ')'
+      sql << ss
     end
   end
 

data/lib/logical_query_parser/nodes/base.rb

@@ -2,13 +2,13 @@ module LogicalQuery
   module ExpNode
   end
 
-  module ExpParenNode
+  module ParenExpNode
   end
 
-  module CondNode
+  module LogicExpNode
   end
 
-  module LiteralSeqNode
+  module LiteralExpNode
   end
 
   module LiteralNode
@@ -23,12 +23,12 @@ module LogicalQuery
   module OrNode
   end
 
-  module LParenNode
+  module NotNode
   end
 
-  module RParenNode
+  module LParenNode
   end
 
-  module NegativeNode
+  module RParenNode
   end
 end

data/lib/logical_query_parser/version.rb

@@ -1,3 +1,3 @@
 module LogicalQuery
-  VERSION = "0.1.0"
+  VERSION = "0.2.0"
 end

data/lib/logical_query_parser.rb

@@ -1,9 +1,10 @@
 require 'treetop'
-require 'logical_query'
 require 'logical_query_parser/version'
 require 'logical_query_parser/nodes/base'
 require 'logical_query_parser/nodes/active_record' if defined? ActiveRecord::Base
 
+Treetop.load File.expand_path("../logical_query.treetop", __FILE__)
+
 class LogicalQueryParser < Treetop::Runtime::CompiledParser
   class << self
     def walk_tree(node, &block)

data/logical_query_parser.gemspec

@@ -21,10 +21,10 @@ Gem::Specification.new do |spec|
 
   spec.add_dependency "treetop", "~> 1.6.8"
 
-  spec.add_development_dependency "bundler", "~> 1.12"
-  spec.add_development_dependency "rake", "~> 10.0"
-  spec.add_development_dependency "rspec", "~> 3.0"
-  spec.add_development_dependency "simplecov", "~> 0.12.0"
-  spec.add_development_dependency "activerecord", ">= 4.2"
+  spec.add_development_dependency "bundler"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec"
+  spec.add_development_dependency "simplecov"
+  spec.add_development_dependency "activerecord"
   spec.add_development_dependency "sqlite3"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: logical_query_parser
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - Yoshikazu Kaneta
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2016-10-12 00:00:00.000000000 Z
+date: 2017-10-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: treetop
@@ -28,72 +28,72 @@ dependencies:
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.12'
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.12'
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '3.0'
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '3.0'
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: simplecov
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 0.12.0
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: 0.12.0
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: activerecord
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '4.2'
+        version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '4.2'
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: sqlite3
   requirement: !ruby/object:Gem::Requirement
@@ -126,7 +126,9 @@ files:
 - Rakefile
 - bin/console
 - bin/setup
-- lib/logical_query.rb
+- gemfiles/rails42.gemfile
+- gemfiles/rails50.gemfile
+- gemfiles/rails51.gemfile
 - lib/logical_query.treetop
 - lib/logical_query_parser.rb
 - lib/logical_query_parser/nodes/active_record.rb
@@ -153,7 +155,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.5.1
+rubygems_version: 2.6.12
 signing_key: 
 specification_version: 4
 summary: A parser for a logical query string.

data/lib/logical_query.rb

@@ -1,889 +0,0 @@
-# Autogenerated from a Treetop grammar. Edits may be lost.
-
-
-module LogicalQuery
-  include Treetop::Runtime
-
-  def root
-    @root ||= :exp
-  end
-
-  module Exp0
-    def any
-      elements[0]
-    end
-  end
-
-  def _nt_exp
-    start_index = index
-    if node_cache[:exp].has_key?(index)
-      cached = node_cache[:exp][index]
-      if cached
-        node_cache[:exp][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    i1 = index
-    r2 = _nt_cond
-    if r2
-      r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-      r1 = r2
-    else
-      r3 = _nt_exp_paren
-      if r3
-        r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
-        r1 = r3
-      else
-        r4 = _nt_literal_seq
-        if r4
-          r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
-          r1 = r4
-        else
-          r5 = _nt_literal
-          if r5
-            r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
-            r1 = r5
-          else
-            @index = i1
-            r1 = nil
-          end
-        end
-      end
-    end
-    s0 << r1
-    if s0.last
-      r0 = instantiate_node(ExpNode,input, i0...index, s0)
-      r0.extend(Exp0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:exp][start_index] = r0
-
-    r0
-  end
-
-  module ExpParen0
-    def lparen
-      elements[0]
-    end
-
-    def exp
-      elements[2]
-    end
-
-    def rparen
-      elements[4]
-    end
-  end
-
-  def _nt_exp_paren
-    start_index = index
-    if node_cache[:exp_paren].has_key?(index)
-      cached = node_cache[:exp_paren][index]
-      if cached
-        node_cache[:exp_paren][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    r1 = _nt_lparen
-    s0 << r1
-    if r1
-      s2, i2 = [], index
-      loop do
-        r3 = _nt_sp
-        if r3
-          s2 << r3
-        else
-          break
-        end
-      end
-      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-      s0 << r2
-      if r2
-        r4 = _nt_exp
-        s0 << r4
-        if r4
-          s5, i5 = [], index
-          loop do
-            r6 = _nt_sp
-            if r6
-              s5 << r6
-            else
-              break
-            end
-          end
-          r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-          s0 << r5
-          if r5
-            r7 = _nt_rparen
-            s0 << r7
-          end
-        end
-      end
-    end
-    if s0.last
-      r0 = instantiate_node(ExpParenNode,input, i0...index, s0)
-      r0.extend(ExpParen0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:exp_paren][start_index] = r0
-
-    r0
-  end
-
-  module Cond0
-    def lexp
-      elements[0]
-    end
-
-    def logic
-      elements[2]
-    end
-
-    def rexp
-      elements[4]
-    end
-  end
-
-  def _nt_cond
-    start_index = index
-    if node_cache[:cond].has_key?(index)
-      cached = node_cache[:cond][index]
-      if cached
-        node_cache[:cond][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    i1 = index
-    r2 = _nt_exp_paren
-    if r2
-      r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-      r1 = r2
-    else
-      r3 = _nt_literal
-      if r3
-        r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
-        r1 = r3
-      else
-        @index = i1
-        r1 = nil
-      end
-    end
-    s0 << r1
-    if r1
-      s4, i4 = [], index
-      loop do
-        r5 = _nt_sp
-        if r5
-          s4 << r5
-        else
-          break
-        end
-      end
-      if s4.empty?
-        @index = i4
-        r4 = nil
-      else
-        r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
-      end
-      s0 << r4
-      if r4
-        i6 = index
-        r7 = _nt_land
-        if r7
-          r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true
-          r6 = r7
-        else
-          r8 = _nt_lor
-          if r8
-            r8 = SyntaxNode.new(input, (index-1)...index) if r8 == true
-            r6 = r8
-          else
-            @index = i6
-            r6 = nil
-          end
-        end
-        s0 << r6
-        if r6
-          s9, i9 = [], index
-          loop do
-            r10 = _nt_sp
-            if r10
-              s9 << r10
-            else
-              break
-            end
-          end
-          if s9.empty?
-            @index = i9
-            r9 = nil
-          else
-            r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
-          end
-          s0 << r9
-          if r9
-            r11 = _nt_exp
-            s0 << r11
-          end
-        end
-      end
-    end
-    if s0.last
-      r0 = instantiate_node(CondNode,input, i0...index, s0)
-      r0.extend(Cond0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:cond][start_index] = r0
-
-    r0
-  end
-
-  module LiteralSeq0
-    def lliteral
-      elements[0]
-    end
-
-    def rliteral
-      elements[2]
-    end
-  end
-
-  def _nt_literal_seq
-    start_index = index
-    if node_cache[:literal_seq].has_key?(index)
-      cached = node_cache[:literal_seq][index]
-      if cached
-        node_cache[:literal_seq][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    r1 = _nt_literal
-    s0 << r1
-    if r1
-      s2, i2 = [], index
-      loop do
-        r3 = _nt_sp
-        if r3
-          s2 << r3
-        else
-          break
-        end
-      end
-      if s2.empty?
-        @index = i2
-        r2 = nil
-      else
-        r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-      end
-      s0 << r2
-      if r2
-        i4 = index
-        r5 = _nt_literal_seq
-        if r5
-          r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
-          r4 = r5
-        else
-          r6 = _nt_literal
-          if r6
-            r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true
-            r4 = r6
-          else
-            @index = i4
-            r4 = nil
-          end
-        end
-        s0 << r4
-      end
-    end
-    if s0.last
-      r0 = instantiate_node(LiteralSeqNode,input, i0...index, s0)
-      r0.extend(LiteralSeq0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:literal_seq][start_index] = r0
-
-    r0
-  end
-
-  module Literal0
-    def negative
-      elements[0]
-    end
-
-    def word
-      elements[1]
-    end
-  end
-
-  def _nt_literal
-    start_index = index
-    if node_cache[:literal].has_key?(index)
-      cached = node_cache[:literal][index]
-      if cached
-        node_cache[:literal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    s1, i1 = [], index
-    loop do
-      r2 = _nt_negative
-      if r2
-        s1 << r2
-      else
-        break
-      end
-    end
-    r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
-    s0 << r1
-    if r1
-      r3 = _nt_word
-      s0 << r3
-    end
-    if s0.last
-      r0 = instantiate_node(LiteralNode,input, i0...index, s0)
-      r0.extend(Literal0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:literal][start_index] = r0
-
-    r0
-  end
-
-  def _nt_word
-    start_index = index
-    if node_cache[:word].has_key?(index)
-      cached = node_cache[:word][index]
-      if cached
-        node_cache[:word][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0 = index
-    r1 = _nt_quoted_word
-    if r1
-      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
-      r0 = r1
-      r0.extend(WordNode)
-    else
-      r2 = _nt_unquoted_word
-      if r2
-        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-        r0 = r2
-        r0.extend(WordNode)
-      else
-        @index = i0
-        r0 = nil
-      end
-    end
-
-    node_cache[:word][start_index] = r0
-
-    r0
-  end
-
-  module QuotedWord0
-  end
-
-  module QuotedWord1
-  end
-
-  def _nt_quoted_word
-    start_index = index
-    if node_cache[:quoted_word].has_key?(index)
-      cached = node_cache[:quoted_word][index]
-      if cached
-        node_cache[:quoted_word][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    if (match_len = has_terminal?('"', false, index))
-      r1 = true
-      @index += match_len
-    else
-      terminal_parse_failure('\'"\'')
-      r1 = nil
-    end
-    s0 << r1
-    if r1
-      s2, i2 = [], index
-      loop do
-        i3 = index
-        if (match_len = has_terminal?('\"', false, index))
-          r4 = instantiate_node(SyntaxNode,input, index...(index + match_len))
-          @index += match_len
-        else
-          terminal_parse_failure('\'\\"\'')
-          r4 = nil
-        end
-        if r4
-          r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
-          r3 = r4
-        else
-          i5, s5 = index, []
-          i6 = index
-          if (match_len = has_terminal?('"', false, index))
-            r7 = true
-            @index += match_len
-          else
-            terminal_parse_failure('\'"\'')
-            r7 = nil
-          end
-          if r7
-            @index = i6
-            r6 = nil
-            terminal_parse_failure('\'"\'', true)
-          else
-            @terminal_failures.pop
-            @index = i6
-            r6 = instantiate_node(SyntaxNode,input, index...index)
-          end
-          s5 << r6
-          if r6
-            if index < input_length
-              r8 = true
-              @index += 1
-            else
-              terminal_parse_failure("any character")
-              r8 = nil
-            end
-            s5 << r8
-          end
-          if s5.last
-            r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
-            r5.extend(QuotedWord0)
-          else
-            @index = i5
-            r5 = nil
-          end
-          if r5
-            r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
-            r3 = r5
-          else
-            @index = i3
-            r3 = nil
-          end
-        end
-        if r3
-          s2 << r3
-        else
-          break
-        end
-      end
-      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
-      s0 << r2
-      if r2
-        if (match_len = has_terminal?('"', false, index))
-          r9 = true
-          @index += match_len
-        else
-          terminal_parse_failure('\'"\'')
-          r9 = nil
-        end
-        s0 << r9
-      end
-    end
-    if s0.last
-      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-      r0.extend(QuotedWord1)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:quoted_word][start_index] = r0
-
-    r0
-  end
-
-  def _nt_unquoted_word
-    start_index = index
-    if node_cache[:unquoted_word].has_key?(index)
-      cached = node_cache[:unquoted_word][index]
-      if cached
-        node_cache[:unquoted_word][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    s0, i0 = [], index
-    loop do
-      r1 = _nt_atom
-      if r1
-        s0 << r1
-      else
-        break
-      end
-    end
-    if s0.empty?
-      @index = i0
-      r0 = nil
-    else
-      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-    end
-
-    node_cache[:unquoted_word][start_index] = r0
-
-    r0
-  end
-
-  def _nt_land
-    start_index = index
-    if node_cache[:land].has_key?(index)
-      cached = node_cache[:land][index]
-      if cached
-        node_cache[:land][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0 = index
-    if (match_len = has_terminal?('AND', false, index))
-      r1 = instantiate_node(SyntaxNode,input, index...(index + match_len))
-      @index += match_len
-    else
-      terminal_parse_failure('\'AND\'')
-      r1 = nil
-    end
-    if r1
-      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
-      r0 = r1
-      r0.extend(AndNode)
-    else
-      if (match_len = has_terminal?('and', false, index))
-        r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
-        @index += match_len
-      else
-        terminal_parse_failure('\'and\'')
-        r2 = nil
-      end
-      if r2
-        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-        r0 = r2
-        r0.extend(AndNode)
-      else
-        @index = i0
-        r0 = nil
-      end
-    end
-
-    node_cache[:land][start_index] = r0
-
-    r0
-  end
-
-  def _nt_lor
-    start_index = index
-    if node_cache[:lor].has_key?(index)
-      cached = node_cache[:lor][index]
-      if cached
-        node_cache[:lor][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0 = index
-    if (match_len = has_terminal?('OR', false, index))
-      r1 = instantiate_node(SyntaxNode,input, index...(index + match_len))
-      @index += match_len
-    else
-      terminal_parse_failure('\'OR\'')
-      r1 = nil
-    end
-    if r1
-      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
-      r0 = r1
-      r0.extend(OrNode)
-    else
-      if (match_len = has_terminal?('or', false, index))
-        r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
-        @index += match_len
-      else
-        terminal_parse_failure('\'or\'')
-        r2 = nil
-      end
-      if r2
-        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-        r0 = r2
-        r0.extend(OrNode)
-      else
-        @index = i0
-        r0 = nil
-      end
-    end
-
-    node_cache[:lor][start_index] = r0
-
-    r0
-  end
-
-  def _nt_lparen
-    start_index = index
-    if node_cache[:lparen].has_key?(index)
-      cached = node_cache[:lparen][index]
-      if cached
-        node_cache[:lparen][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    if (match_len = has_terminal?('(', false, index))
-      r0 = instantiate_node(LParenNode,input, index...(index + match_len))
-      @index += match_len
-    else
-      terminal_parse_failure('\'(\'')
-      r0 = nil
-    end
-
-    node_cache[:lparen][start_index] = r0
-
-    r0
-  end
-
-  def _nt_rparen
-    start_index = index
-    if node_cache[:rparen].has_key?(index)
-      cached = node_cache[:rparen][index]
-      if cached
-        node_cache[:rparen][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    if (match_len = has_terminal?(')', false, index))
-      r0 = instantiate_node(RParenNode,input, index...(index + match_len))
-      @index += match_len
-    else
-      terminal_parse_failure('\')\'')
-      r0 = nil
-    end
-
-    node_cache[:rparen][start_index] = r0
-
-    r0
-  end
-
-  def _nt_negative
-    start_index = index
-    if node_cache[:negative].has_key?(index)
-      cached = node_cache[:negative][index]
-      if cached
-        node_cache[:negative][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0 = index
-    if (match_len = has_terminal?('-', false, index))
-      r1 = true
-      @index += match_len
-    else
-      terminal_parse_failure('\'-\'')
-      r1 = nil
-    end
-    if r1
-      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
-      r0 = r1
-      r0.extend(NegativeNode)
-    else
-      if (match_len = has_terminal?('-', false, index))
-        r2 = true
-        @index += match_len
-      else
-        terminal_parse_failure('\'-\'')
-        r2 = nil
-      end
-      if r2
-        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-        r0 = r2
-        r0.extend(NegativeNode)
-      else
-        if (match_len = has_terminal?('－', false, index))
-          r3 = true
-          @index += match_len
-        else
-          terminal_parse_failure('\'－\'')
-          r3 = nil
-        end
-        if r3
-          r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
-          r0 = r3
-          r0.extend(NegativeNode)
-        else
-          @index = i0
-          r0 = nil
-        end
-      end
-    end
-
-    node_cache[:negative][start_index] = r0
-
-    r0
-  end
-
-  def _nt_sp
-    start_index = index
-    if node_cache[:sp].has_key?(index)
-      cached = node_cache[:sp][index]
-      if cached
-        node_cache[:sp][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0 = index
-    if (match_len = has_terminal?(' ', false, index))
-      r1 = true
-      @index += match_len
-    else
-      terminal_parse_failure('\' \'')
-      r1 = nil
-    end
-    if r1
-      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
-      r0 = r1
-    else
-      if (match_len = has_terminal?('　', false, index))
-        r2 = true
-        @index += match_len
-      else
-        terminal_parse_failure('\'　\'')
-        r2 = nil
-      end
-      if r2
-        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
-        r0 = r2
-      else
-        @index = i0
-        r0 = nil
-      end
-    end
-
-    node_cache[:sp][start_index] = r0
-
-    r0
-  end
-
-  module Atom0
-  end
-
-  def _nt_atom
-    start_index = index
-    if node_cache[:atom].has_key?(index)
-      cached = node_cache[:atom][index]
-      if cached
-        node_cache[:atom][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
-        @index = cached.interval.end
-      end
-      return cached
-    end
-
-    i0, s0 = index, []
-    i1 = index
-    i2 = index
-    r3 = _nt_lparen
-    if r3
-      r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
-      r2 = r3
-    else
-      r4 = _nt_rparen
-      if r4
-        r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
-        r2 = r4
-      else
-        r5 = _nt_negative
-        if r5
-          r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
-          r2 = r5
-        else
-          r6 = _nt_sp
-          if r6
-            r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true
-            r2 = r6
-          else
-            @index = i2
-            r2 = nil
-          end
-        end
-      end
-    end
-    if r2
-      @index = i1
-      r1 = nil
-      terminal_parse_failure("(any alternative)", true)
-    else
-      @terminal_failures.pop
-      @index = i1
-      r1 = instantiate_node(SyntaxNode,input, index...index)
-    end
-    s0 << r1
-    if r1
-      if index < input_length
-        r7 = true
-        @index += 1
-      else
-        terminal_parse_failure("any character")
-        r7 = nil
-      end
-      s0 << r7
-    end
-    if s0.last
-      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
-      r0.extend(Atom0)
-    else
-      @index = i0
-      r0 = nil
-    end
-
-    node_cache[:atom][start_index] = r0
-
-    r0
-  end
-
-end
-
-class LogicalQueryParser < Treetop::Runtime::CompiledParser
-  include LogicalQuery
-end
-
-