dendroid 0.2.00 → 0.2.02

data/lib/dendroid/parsing/parser.rb

@@ -1,185 +0,0 @@
-# frozen_string_literal: true
-
-require 'weakref'
-require_relative '../grm_dsl/base_grm_builder'
-require_relative '../utils/base_tokenizer'
-require_relative '../recognizer/recognizer'
-require_relative 'chart_walker'
-require_relative 'parse_tree_visitor'
-require_relative '../formatters/bracket_notation'
-require_relative '../formatters/ascii_tree'
-
-module Dendroid
-  module Parsing
-    class Parser
-    end # class
-  end # module
-end # module
-
-def grammar_l1
-  builder = Dendroid::GrmDSL::BaseGrmBuilder.new do
-    # Grammar inspired from Wikipedia entry on Earley parsing
-    declare_terminals('PLUS', 'STAR', 'INTEGER')
-    rule('p' => 's')
-    rule('s' => ['s PLUS m', 'm'])
-    rule('m' => ['m STAR t', 't'])
-    rule('t' => 'INTEGER')
-  end
-
-  builder.grammar
-end
-
-def grammar_l31
-  builder = Dendroid::GrmDSL::BaseGrmBuilder.new do
-    # Ambiguous arithmetical expression language
-    # This language is compatible with tokenizer L1
-    declare_terminals('PLUS', 'STAR', 'INTEGER')
-    rule('p' => 's')
-    rule('s' => ['s PLUS s', 's STAR s', 'INTEGER'])
-  end
-
-  builder.grammar
-end
-
-def tokenizer_l1
-  Dendroid::Utils::BaseTokenizer.new do
-    map_verbatim2terminal({ '+' => :PLUS, '*' => :STAR })
-
-    scan_verbatim(['+', '*'])
-    scan_value(/\d+/, :INTEGER, ->(txt) { txt.to_i })
-  end
-end
-
-def retrieve_success_item(chart, grammar)
-  last_item_set = chart.item_sets.last
-  result = nil
-  last_item_set.items.reverse_each do |itm|
-    if itm.origin.zero? && itm.dotted_item.completed? && itm.dotted_item.rule.lhs == grammar.start_symbol
-      result = itm
-      break
-    end
-  end
-
-  result
-end
-
-def grammar_l10
-  # Grammar with left recursive rule
-  builder = Dendroid::GrmDSL::BaseGrmBuilder.new do
-    declare_terminals('a')
-
-    rule 'A' => ['A a', '']
-  end
-
-  builder.grammar
-end
-
-def tokenizer_l10
-  Dendroid::Utils::BaseTokenizer.new do
-    map_verbatim2terminal({ 'a' => :a })
-
-    scan_verbatim(['a'])
-  end
-end
-
-def grammar_l11
-  builder = Dendroid::GrmDSL::BaseGrmBuilder.new do
-    # Grammar with right-recursive rule
-    declare_terminals('a')
-
-    rule 'A' => ['a A', '']
-  end
-
-  builder.grammar
-end
-
-def tokenizer_l11
-  Dendroid::Utils::BaseTokenizer.new do
-    map_verbatim2terminal({ 'a' => :a })
-
-    scan_verbatim(['a'])
-  end
-end
-
-def grammar_l8
-  builder = Dendroid::GrmDSL::BaseGrmBuilder.new do
-    # (based on grammar G2 from paper Masaru Tomita "An Efficient Context-Free Parsing Algorithm
-    #   for Natural Languages")
-    declare_terminals('x')
-
-    rule 'S' => ['S S', 'x']
-  end
-
-  builder.grammar
-end
-
-def tokenizer_l8
-  Dendroid::Utils::BaseTokenizer.new do
-    map_verbatim2terminal({ 'x' => :x })
-
-    scan_verbatim(['x'])
-  end
-end
-
-########################################
-# Entry point
-########################################
-kode = 3
-
-case kode
-when 0
-  recognizer = Dendroid::Recognizer::Recognizer.new(grammar_l1, tokenizer_l1)
-  chart = recognizer.run('2 + 3 * 4')
-  succ_item =  retrieve_success_item(chart, recognizer.grm_analysis.grammar)
-  walker = Dendroid::Parsing::ChartWalker.new(chart)
-  root = walker.walk(succ_item)
-
-  # formatter = BracketNotation.new($stdout)
-  formatter = Asciitree.new($stdout)
-  visitor = ParseTreeVisitor.new(root)
-  formatter.render(visitor)
-
-when 1
-  recognizer = Dendroid::Recognizer::Recognizer.new(grammar_l10, tokenizer_l10)
-  chart = recognizer.run('a a a a a')
-  succ_item =  retrieve_success_item(chart, recognizer.grm_analysis.grammar)
-  walker = Dendroid::Parsing::ChartWalker.new(chart)
-  root = walker.walk(succ_item)
-
-  formatter = Asciitree.new($stdout)
-  visitor = ParseTreeVisitor.new(root)
-  formatter.render(visitor)
-
-when 2
-  recognizer = Dendroid::Recognizer::Recognizer.new(grammar_l11, tokenizer_l11)
-  chart = recognizer.run('a a a a a')
-  succ_item =  retrieve_success_item(chart, recognizer.grm_analysis.grammar)
-  walker = Dendroid::Parsing::ChartWalker.new(chart)
-  root = walker.walk(succ_item)
-
-  formatter = Asciitree.new($stdout)
-  visitor = ParseTreeVisitor.new(root)
-  formatter.render(visitor)
-
-when 3
-  recognizer = Dendroid::Recognizer::Recognizer.new(grammar_l31, tokenizer_l1)
-  chart = recognizer.run('2 + 3 * 4')
-  succ_item =  retrieve_success_item(chart, recognizer.grm_analysis.grammar)
-  walker = Dendroid::Parsing::ChartWalker.new(chart)
-  root = walker.walk(succ_item)
-
-  formatter = Asciitree.new($stdout)
-  visitor = ParseTreeVisitor.new(root)
-  formatter.render(visitor)
-
-when 4
-  recognizer = Dendroid::Recognizer::Recognizer.new(grammar_l8, tokenizer_l8)
-  chart = recognizer.run('x x x x')
-  succ_item =  retrieve_success_item(chart, recognizer.grm_analysis.grammar)
-  walker = Dendroid::Parsing::ChartWalker.new(chart)
-  root = walker.walk(succ_item)
-
-  formatter = Asciitree.new($stdout)
-  visitor = ParseTreeVisitor.new(root)
-  formatter.render(visitor)
-end