grammar_ambig01_helper.rb in rley-0.8.00

- old
+ new

@@ -1,18 +1,18 @@
 # frozen_string_literal: true
 
 # Load the builder class
-require_relative '../../../lib/rley/syntax/grammar_builder'
+require_relative '../../../lib/rley/syntax/base_grammar_builder'
 require_relative '../../../lib/rley/lexical/token'
 
 
 module GrammarAmbig01Helper
   ########################################
   # Factory method. Define a grammar for a very simple language
   # Grammar 3: An ambiguous arithmetic expression language
   # (based on example in article on Earley's algorithm in Wikipedia)
   def grammar_ambig01_builder
-    Rley::Syntax::GrammarBuilder.new do
+    Rley::Syntax::BaseGrammarBuilder.new do
       add_terminals('integer', '+', '*')
       rule 'P' => 'S'
       rule 'S' => 'S + S'
       rule 'S' => 'S * S'
       rule 'S' => 'L'