lib/antelope/generation/constructor/follow.rb in antelope-0.2.4 vs lib/antelope/generation/constructor/follow.rb in antelope-0.3.0

@@ -16,16 +16,16 @@
         # Returns the FOLLOW set of the given token.  If the given
         # token isn't a nonterminal, it raises an error.  It then
         # generates the FOLLOW set for the given token, and then
         # caches it.
         #
-        # @return [Set<Ace::Token>]
+        # @return [Set<Grammar::Token>]
         # @see Constructor#incorrect_argument!
         # @see #generate_follow_set
         def follow(token)
-          unless token.is_a? Ace::Token::Nonterminal
-            incorrect_argument! token, Ace::Token::Nonterminal
+          unless token.is_a? Grammar::Token::Nonterminal
+            incorrect_argument! token, Grammar::Token::Nonterminal
           end
 
           @follows.fetch(token) { generate_follow_set(token) }
         end
 
@@ -60,12 +60,12 @@
         # In case this operation is potentially recursive, we make
         # sure to set the FOLLOW set of `B` to an empty set (since we
         # cache the result of a FOLLOW set, the empty set will be
         # returned).
         #
-        # @param token [Ace::Token::Nonterminal]
-        # @return [Set<Ace::Token>]
+        # @param token [Grammar::Token::Nonterminal]
+        # @return [Set<Grammar::Token>]
         # @see First#first
         # @see Nullable#nullable?
         def generate_follow_set(token)
           # Set it to the empty set so we don't end up recursing.
           @follows[token] = Set.new
@@ -94,10 +94,10 @@
 
               i += 1
             end
           end
 
-          # Replace the cached empty set with our filled set.
+          # ReplGrammar the cached empty set with our filled set.
           @follows[token] = set
         end
       end
     end
   end