rparsec-ruby19 1.0

data/test/src/sql.rb

@@ -0,0 +1,268 @@
+require 'import'
+import :misc
+
+include RParsec
+class Module
+  include DefHelper
+end
+class Expr
+  def self.binary(*ops)
+    ops.each do |op|
+      define_method(op) do |other|
+        BinaryExpr.new(self, op, other)
+      end
+    end
+  end
+  binary :+,:-,:*,:/,:%
+  def -@
+    PrefixExpr.new(:-, self)
+  end
+  def self.compare(*ops)
+    ops.each do |op|
+      define_method(op) do |other|
+        ComparePredicate.new(self, op, other)
+      end
+    end
+  end
+  compare :'==', :'>', :'<', :'>=', :'<='
+end
+class LiteralExpr < Expr
+  def_readable :lit
+  def to_s
+    @lit.to_s
+  end
+end
+class VarExpr < Expr
+  def_readable :name
+  def to_s
+    "$#{name}"
+  end
+end
+class WordExpr < Expr
+  def_readable :name
+  def to_s
+    name
+  end
+end
+class QualifiedColumnExpr < Expr
+  def_readable :owner, :col
+  def to_s
+    "#{owner}.#{col}"
+  end
+end
+class WildcardExpr < Expr
+  Instance = WildcardExpr.new
+  def to_s
+    '*'
+  end
+end
+class BinaryExpr < Expr
+  def_readable :left, :op, :right
+  def to_s
+    "(#{left} #{op} #{right})"
+  end
+end
+class PostfixExpr < Expr
+  def_readable :expr, :op
+  def to_s
+    "(#{expr} #{op})"
+  end
+end
+class PrefixExpr < Expr
+  def_readable :op, :expr
+  def to_s
+    "(#{op} #{expr})"
+  end
+end
+def cases_string cases, default, result
+    cases.each do |cond, val|
+      result << " when #{cond}: #{val}"
+    end
+    unless default.nil?
+      result << " else #{default}"
+    end
+    result << " end"
+    result
+end
+class SimpleCaseExpr < Expr
+  def_readable :expr, :cases, :default
+  def to_s
+    cases_string cases, default, "case #{expr}"
+  end
+end
+class CaseExpr < Expr
+  def_readable :cases, :default
+  def to_s
+    cases_string cases, default, 'case'
+  end
+end
+
+
+############Predicate########################
+class Predicate
+end
+
+class ComparePredicate < Predicate
+  def_readable :left, :op, :right
+  def to_s
+    "#{left} #{op_name} #{right}"
+  end
+  def op_name
+    case op when :"!=": "<>" else op.to_s end
+  end
+end
+class CompoundPredicate < Predicate
+  def_readable :left, :op, :right
+  def to_s
+    "(#{left} #{op} #{right})"
+  end
+end
+class NotPredicate < Predicate
+  def_readable :predicate
+  def to_s
+    "(not #{predicate})"
+  end
+end
+class ExistsPredicate < Predicate
+  def_readable :relation
+  def to_s
+    "exists(#{relation})"
+  end
+end
+class NotExistsPredicate < Predicate
+  def_readable :relation
+  def to_s
+    "not exists(#{relation})"
+  end
+end
+class InRelationPredicate < Predicate
+  def_readable :expr, :relation
+  def to_s
+    "#{expr} in (#{relation})"
+  end
+end
+class NotInRelationPredicate < Predicate
+  def_readable :expr, :relation
+  def to_s
+    "#{expr} not in (#{relation})"
+  end
+end
+class InPredicate < Predicate
+  def_readable :expr, :vals
+  def to_s
+    "#{expr} in (#{vals.join(', ')})"
+  end
+end
+class NotInPredicate < Predicate
+  def_readable :expr, :vals
+  def to_s
+    "#{expr} not in (#{vals.join(', ')})"
+  end
+end
+class BetweenPredicate < Predicate
+  def_readable :expr, :from, :to
+  def to_s
+    "#{expr} between #{from} and #{to}"
+  end
+end
+class NotBetweenPredicate < Predicate
+  def_readable :expr, :from, :to
+  def to_s
+    "#{expr} not between #{from} and #{to}"
+  end
+end
+class GroupComparisonPredicate < Predicate
+  def_readable :group1, :op, :group2
+  def to_s
+    "#{list_exprs group1} #{op} #{list_exprs group2}"
+  end
+  def list_exprs exprs
+    "(#{exprs.join(', ')})"
+  end
+end
+#############Relations######################
+
+class OrderElement
+  def_readable :expr, :asc
+  def to_s
+    result = "#{expr}"
+    unless asc
+      result << ' desc'
+    end
+    result
+  end
+end
+class GroupByClause
+  def_readable :exprs, :having
+  def to_s
+    result = exprs.join(', ')
+    unless having.nil?
+      result << " having #{having}"
+    end
+    result
+  end
+end
+class Relation
+  def as_inner
+    to_s
+  end
+end
+class TableRelation < Relation
+  def_readable :table
+  def to_s
+    table
+  end
+end
+class SelectRelation < Relation
+  def_readable :select, :distinct, :from, :where, :groupby, :orderby
+  def to_s
+    result = "select "
+    if distinct
+      result << 'distinct '
+    end
+    result << "#{select.join(', ')} from #{from.as_inner}"
+    unless where.nil?
+      result << " where #{where}"
+    end
+    unless groupby.nil?
+      result << " group by #{groupby}"
+    end
+    unless orderby.nil?
+      result << " order by #{orderby.join(', ')}"
+    end
+    result
+  end
+  def as_inner
+    "(#{self})"
+  end
+end
+class LimitRelation < Relation
+  def_readable :rel, :limit
+  def to_s
+    "#{rel} limit #{limit}"
+  end
+end
+class JoinRelation < Relation
+  def_readable :kind, :left, :right, :on
+  def to_s
+    "#{left} #{kind} join #{right} on #{on}"
+  end
+end
+class CrossJoinRelation < Relation
+  def_readable :left, :right
+  def to_s
+    "#{left} cross join #{right}"
+  end
+end
+class AliasRelation < Relation
+  def_readable :relation, :name
+  def to_s
+    "#{relation.as_inner} AS #{name}"
+  end
+end
+class UnionRelation < Relation
+  def_readable :left, :all, :right
+  def to_s
+    "#{left} union #{case when all: 'all ' else '' end}#{right}"
+  end
+end

data/test/src/sql_parser.rb

@@ -0,0 +1,258 @@
+require 'import'
+import :parsers, :keywords, :operators, :functors, :expressions
+
+include RParsec
+
+class Method
+  include FunctorMixin
+end
+class Proc
+  include FunctorMixin
+end
+module SqlParser
+  include Functors
+  include Parsers
+  extend Parsers
+  MyKeywords = Keywords.case_insensitive(%w{
+    select from where group by having order desc asc
+    inner left right full outer inner join on cross
+    union all distinct as exists in between limit
+    case when else end and or not true false
+  })
+  MyOperators = Operators.new(%w{+ - * / % = > < >= <= <> != : ( ) . ,})
+  def self.operators(*ops)
+    result = []
+    ops.each do |op|
+      result << (MyOperators[op] >> op.to_sym)
+    end
+    sum(*result)
+  end
+  Comparators = operators(*%w{= > < >= <= <> !=})
+  StringLiteral = (char(?') >> (not_char(?')|str("''")).many_.fragment << char(?')).
+    map do |raw|
+      raw.gsub!(/''/,"'")
+    end
+  QuotedName = char(?[) >> not_char(?]).many_.fragment << char(?])
+  Variable = char(?$) >> word
+  MyLexer = number.token(:number) | StringLiteral.token(:string) | Variable.token(:var) | QuotedName.token(:word) |
+    MyKeywords.lexer | MyOperators.lexer
+  MyLexeme = MyLexer.lexeme(whitespaces | comment_line('#')) << eof
+  
+  
+  ######################################### utilities #########################################
+  def keyword
+    MyKeywords
+  end
+  def operator
+    MyOperators
+  end
+  def comma
+    operator[',']
+  end
+  def list expr
+    paren(expr.delimited(comma))
+  end
+  def word(&block)
+    if block.nil?
+      token(:word, &Id)
+    else
+      token(:word, &block)
+    end
+  end 
+  def paren parser
+    operator['('] >> parser << operator[')']
+  end
+  def ctor cls
+    cls.method :new
+  end
+  def rctor cls, arity=2
+    ctor(cls).reverse_curry arity
+  end
+  ################################### predicate parser #############################
+  def logical_operator op
+    proc{|a,b|CompoundPredicate.new(a,op,b)}
+  end
+  def make_predicate expr, rel
+    expr_list = list expr
+    comparison = make_comparison_predicate expr, rel
+    group_comparison = sequence(expr_list, Comparators, expr_list, &ctor(GroupComparisonPredicate))
+    bool = nil
+    lazy_bool = lazy{bool}
+    bool_term = keyword[:true] >> true | keyword[:false] >> false |
+      comparison | group_comparison | paren(lazy_bool) |
+      make_exists(rel) | make_not_exists(rel)
+    bool_table = OperatorTable.new.
+      infixl(keyword[:or] >> logical_operator(:or), 20).
+      infixl(keyword[:and] >> logical_operator(:and), 30).
+      prefix(keyword[:not] >> ctor(NotPredicate), 40)
+    bool = Expressions.build(bool_term, bool_table)
+  end
+  def make_exists rel
+    keyword[:exists] >> rel.map(&ctor(ExistsPredicate))
+  end
+  def make_not_exists rel
+    keyword[:not] >> keyword[:exists] >> rel.map(&ctor(NotExistsPredicate))
+  end
+  def make_in expr
+    keyword[:in] >> list(expr) >> map(&rctor(InPredicate))
+  end
+  def make_not_in expr
+    keyword[:not] >> keyword[:in] >> list(expr) >> map(&rctor(NotInPredicate))
+  end
+  def make_in_relation rel
+    keyword[:in] >> rel.map(&rctor(InRelationPredicate))
+  end
+  def make_not_in_relation rel
+    keyword[:not] >> keyword[:in] >> rel.map(&rctor(NotInRelationPredicate))
+  end
+  def make_between expr
+    make_between_clause(expr, &ctor(BetweenPredicate))
+  end
+  def make_not_between expr
+    keyword[:not] >> make_between_clause(expr, &ctor(NotBetweenPredicate))
+  end
+  def make_comparison_predicate expr, rel
+    comparison = sequence(Comparators, expr) do |op,e2|
+      proc{|e1|ComparePredicate.new(e1, op, e2)}
+    end
+    in_clause = make_in expr
+    not_in_clause = make_not_in expr
+    in_relation = make_in_relation rel
+    not_in_relation = make_not_in_relation rel
+    between = make_between expr
+    not_between = make_not_between expr
+    compare_with = comparison | in_clause | not_in_clause |
+        in_relation | not_in_relation | between | not_between
+    sequence(expr, compare_with, &Feed)
+  end
+  def make_between_clause expr, &maker
+    factory = proc do |a,_,b|
+      proc {|v|maker.call(v,a,b)}
+    end
+    variant1 = keyword[:between] >> paren(sequence(expr, comma, expr, &factory))
+    variant2 = keyword[:between] >> sequence(expr, keyword[:and], expr, &factory)
+    variant1 | variant2
+  end
+  
+  ################################ expression parser ###############################
+  def calculate_simple_cases(val, cases, default)
+    SimpleCaseExpr.new(val, cases, default)
+  end
+  def calculate_full_cases(cases, default)
+    CaseExpr.new(cases, default)
+  end
+  def make_expression predicate, rel
+    expr = nil
+    lazy_expr = lazy{expr}
+    simple_case = sequence(keyword[:when], lazy_expr, operator[':'], lazy_expr) do |_,cond,_,val|
+      [cond, val]
+    end
+    full_case = sequence(keyword[:when], predicate, operator[':'], lazy_expr) do |_,cond,_,val|
+      [cond, val]
+    end
+    default_case = (keyword[:else] >> lazy_expr).optional
+    simple_when_then = sequence(lazy_expr, simple_case.many, default_case, 
+      keyword[:end]) do |val, cases, default, _|
+      calculate_simple_cases(val, cases, default)
+    end
+    full_when_then = sequence(full_case.many, default_case, keyword[:end]) do |cases, default, _|
+      calculate_full_cases(cases, default)
+    end
+    case_expr = keyword[:case] >> (simple_when_then | full_when_then)
+    wildcard = operator[:*] >> WildcardExpr::Instance
+    lit = token(:number, :string, &ctor(LiteralExpr)) | token(:var, &ctor(VarExpr))
+    atom = lit | wildcard |
+      sequence(word, operator['.'], word|wildcard) {|owner, _, col| QualifiedColumnExpr.new owner, col} |
+      word(&ctor(WordExpr))
+    term = atom | (operator['('] >> lazy_expr << operator[')']) | case_expr
+    table = OperatorTable.new.
+      infixl(operator['+'] >> Plus, 20).
+      infixl(operator['-'] >> Minus, 20).
+      infixl(operator['*'] >> Mul, 30).
+      infixl(operator['/'] >> Div, 30).
+      infixl(operator['%'] >> Mod, 30).
+      prefix(operator['-'] >> Neg, 50)
+    expr = Expressions.build(term, table)
+  end
+  
+  ################################ relation parser ###############################
+  def make_relation expr, pred
+    exprs = expr.delimited1(comma)
+    relation = nil
+    lazy_relation = lazy{relation}
+    term_relation = word {|w|TableRelation.new w} | operator['('] >> lazy_relation << operator[')']
+    sub_relation = sequence(term_relation, (keyword[:as].optional >> word).optional) do |rel, name|
+      case when name.nil?: rel else AliasRelation.new(rel, name) end
+    end
+    joined_relation = sub_relation.postfix(join_maker(lazy{joined_relation}, pred))
+    where_clause = keyword[:where] >> pred
+    order_element = sequence(expr, (keyword[:asc] >> true | keyword[:desc] >> false).optional(true),
+      &ctor(OrderElement))
+    order_elements = order_element.separated1(comma)
+    exprs = expr.separated1(comma)
+    order_by_clause = keyword[:order] >> keyword[:by] >> order_elements
+    group_by = keyword[:group] >> keyword[:by] >> exprs
+    group_by_clause = sequence(group_by, (keyword[:having] >> pred).optional, &ctor(GroupByClause))
+    relation = sub_relation | sequence(keyword[:select], 
+      keyword[:distinct].optional(false), exprs, 
+      keyword[:from], joined_relation,
+      where_clause.optional, group_by_clause.optional, order_by_clause.optional
+    ) do |_, distinct, projected, _, from, where, groupby, orderby|
+      SelectRelation.new(projected, distinct, from, where, groupby, orderby)
+    end
+    relation = sequence(relation, (keyword[:limit] >> token(:number, &To_i)).optional) do |rel, limit|
+      case when limit.nil?: rel else LimitRelation.new(rel, limit) end
+    end
+    relation = relation.infixl(union_maker)
+  end
+  def union_maker
+    keyword[:union] >> (keyword[:all]>>true|false).map do |all|
+      proc {|r1, r2|UnionRelation.new(r1, all, r2)}
+    end
+  end
+  def join_maker rel, pred
+    crossjoin = keyword[:cross] >> keyword[:join] >> rel.map(&rctor(CrossJoinRelation))
+    leftjoin = outer_join :left
+    rightjoin = outer_join :right
+    fulljoin = outer_join :full
+    innerjoin = keyword[:inner].optional >> keyword[:join] >> :inner
+    join_with_condition = sequence(sum(leftjoin, rightjoin, innerjoin), rel, 
+      keyword[:on], pred) do |kind, r, _, on|
+        proc{|r0|JoinRelation.new(kind, r0, r, on)}
+      end
+    sum(crossjoin, join_with_condition)
+  end
+  def outer_join kind
+    keyword[kind] >> keyword[:outer].optional >> keyword[:join] >> kind
+  end
+  
+  
+  
+  ########################## put together ###############################
+  def expression
+    assemble[0]
+  end
+
+  def relation
+    assemble[2]
+  end
+  def predicate
+    assemble[1]
+  end
+  
+  def assemble
+    pred = nil
+    rel = nil
+    lazy_predicate = lazy{pred}
+    lazy_rel = lazy{rel}
+    expr = make_expression lazy_predicate, lazy_rel
+    pred = make_predicate expr, lazy_rel
+    rel = make_relation expr, pred
+    return expr, pred, rel
+  end
+  
+  
+  def make parser
+    MyLexeme.nested(parser << eof)
+  end
+end