dendroid 0.2.01 → 0.2.02

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8a6ce20fae6c5c7d07a9995e8adf97affcddc654edd7c72ff82b63b7fab42aff
-  data.tar.gz: e3b5dbf5ebc3468a11349a809914fd0178603f926f74a36f8848f128916f9b5f
+  metadata.gz: bb58d7b275f7eb65ccfef37ee213fc53319c5634cf8dbd79020451c79769a3c3
+  data.tar.gz: f075b751545df13bda67d3e2df1c3861dfdaffa8fc416a7a735d0c4fc2da01bb
 SHA512:
-  metadata.gz: 865063f7b0f5234871956ec35fb2cf9279804cef999d1d8041a9dde92776c3fae8d96b2aeb56bf3f1b8889a10348eef33f39e8321d8c47cd8a8db6c8a4d637f1
-  data.tar.gz: 83f74f28495fe104c7ea9ed7e58031017636b0eedf090ab19175bb5d5e5281329307c7e06fb7e47c1f43705bfb1b65a42c441a84b352de527bf4470212862572
+  metadata.gz: 1f3598bbc4f19ff183e655a92ca86908615a10b2f142982c09eb11b01b9fd05296db1ce5b9fa14be9d5f71c8358fd60535a0eb8b0feea8fcddafae5100fe8df4
+  data.tar.gz: c3227a5e8cb2675d2de6d011091e3b665e0217e62401619db36e43967a9d407c06a50205031c03dacc43f72b01cd1b0ebf66132240194d61de1ae1e167594113

data/CHANGELOG.md

@@ -2,12 +2,25 @@
 
 ## [Unreleased]
 
+## [0.2.02] - 2023-12-18
+Code re-styling to fix most Rubocop offenses.
+
+### Added
+- Directory 'modeling' for PlantUML text files.
+
+### Changed
+- File `dendroid.rb`: added `relative_require` to load key dependencies. 
+
 ## [0.2.01] - 2023-12-17
 Code re-styling to fix most Rubocop offenses.
 
 ## [0.2.00] - 2023-12-16
 Version bump: Very crude parser implementation (generate shared parse forests in case of ambiguity).
 
+### Added
+- Directory `parsing`: module implementing a parser
+- Directory `formatters`: module with classes for rendering parse tree/forest 
+
 ## [0.1.00] - 2023-11-03
 Version bump: the Earley recognizer is functional.
 

data/lib/dendroid/parsing/composite_parse_node.rb

@@ -5,7 +5,6 @@ require_relative 'parse_node'
 module Dendroid
   module Parsing
     class CompositeParseNode < ParseNode
-      attr_reader :range
       attr_reader :children
 
       def initialize(lowerBound, upperBound, child_count)

data/lib/dendroid/syntax/grammar.rb

@@ -57,7 +57,6 @@ module Dendroid
         rules << rule
         nonterm2production[rule.head] = rule
       end
-
       # rubocop: enable Style/IfUnlessModifier
 
       # Return the start symbol for the language, that is,
@@ -271,11 +270,6 @@ module Dendroid
           end
         end
 
-        # symbols.each do |sym|
-        #   next if sym.terminal?
-        #
-        #   sym.nullable = false if sym.nullable.nil?
-        # end
         symbols.each do |sym|
           next if sym.terminal? || sym.nullable?
 

data/lib/dendroid.rb

@@ -1,5 +1,18 @@
 # frozen_string_literal: true
 
+# File: dendroid.rb
+
 # Namespace for all modules, classes and constants from Dendroid library.
 module Dendroid
 end # module
+
+
+# This file acts as a jumping-off point for loading dependencies expected
+# for a Dendroid client.
+
+require_relative './dendroid/grm_dsl/base_grm_builder'
+require_relative './dendroid/utils/base_tokenizer'
+require_relative './dendroid/recognizer/recognizer'
+require_relative './dendroid/parsing/chart_walker'
+require_relative './dendroid/parsing/parse_tree_visitor'
+require_relative './dendroid//formatters/ascii_tree'

data/version.txt

@@ -1 +1 @@
-0.2.01
+0.2.02

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: dendroid
 version: !ruby/object:Gem::Version
-  version: 0.2.01
+  version: 0.2.02
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-12-17 00:00:00.000000000 Z
+date: 2023-12-18 00:00:00.000000000 Z
 dependencies: []
 description: WIP. A Ruby implementation of an Earley parser
 email: famished.tiger@yahoo.com
@@ -41,7 +41,6 @@ files:
 - lib/dendroid/parsing/or_node.rb
 - lib/dendroid/parsing/parse_node.rb
 - lib/dendroid/parsing/parse_tree_visitor.rb
-- lib/dendroid/parsing/parser.rb
 - lib/dendroid/parsing/terminal_node.rb
 - lib/dendroid/parsing/walk_progress.rb
 - lib/dendroid/recognizer/chart.rb

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