rbs-inline 0.4.0 → 0.6.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 713b2bd4c5ddd833fa1bd1a71505924081013101a8a41200a88fed55751146ba
-  data.tar.gz: 44ffe7a91c0c0afeb7e163a02de508c50f96a609ae7c64593a6b739109ac11b0
+  metadata.gz: 330c5c083c1dda38f3f0263729aea1d39c16484e67deee0717b28881ec22da8a
+  data.tar.gz: 2f1e8f2910669d33f6ed64897b0e5db00285b42626d846402a85c5c294c23155
 SHA512:
-  metadata.gz: 6507f727be79bcae3890c8b8c3c3865544022058e44d5bfd060efb5df0c91e50f2b5e43a11f284c7ea3de1066bdd0ed7e269a14c20b45cc05cafa7ad60ecffb7
-  data.tar.gz: aad87cafa19657b4d4b055527924146cb232cd96c56081bcbb24c1e1b0ff2fc24a449bdfe2132a43c2e5f5ac2affca8d615d0946b135676979556eaca4887aec
+  metadata.gz: ad396cb989f857ada7203ca6ab2129dae79f471520d816e791c8be80b9d3d4b3d5301f8360dfe8ccba5fe30d99f92dd56eea81c32b092a946d91aab431f57e26
+  data.tar.gz: 4487616c28a042e68f167ea191b7ab4265704228b6a104e0bf52a15d909b096bb8a8798d273de97cebba72f2a8bf0b2635168cee5e7961a7c37ec0a9f3364c25

data/README.md

@@ -8,29 +8,32 @@ RBS::Inline allows embedding RBS type declarations into Ruby code as comments. Y
 > [!IMPORTANT]
 > This gem is a prototype for testing. We plan to merge this feature to rbs-gem and deprecate rbs-inline gem after that.
 
+> [!NOTE]
+> Use Steep >= `1.8.0.dev` to avoid the conflicts on `#:` syntax.
+
 Here is a quick example of embedded declarations.
 
 ```rb
 # rbs_inline: enabled
 
 class Person
-  attr_reader :name #:: String
+  attr_reader :name #: String
 
-  attr_reader :addresses #:: Array[String]
+  attr_reader :addresses #: Array[String]
 
   # @rbs name: String
   # @rbs addresses: Array[String]
-  # @rbs returns void
+  # @rbs return: void
   def initialize(name:, addresses:)
     @name = name
     @addresses = addresses
   end
 
-  def to_s #:: String
+  def to_s #: String
     "Person(name = #{name}, addresses = #{addresses.join(", ")})"
   end
 
-  # @rbs yields (String) -> void
+  # @rbs &block: (String) -> void
   def each_address(&block) #:: void
     addresses.each(&block)
   end

data/Rakefile

@@ -10,3 +10,15 @@ Rake::TestTask.new(:test) do |t|
 end
 
 task default: :test
+
+namespace :rbs do
+  task :generate do
+    sh "rbs-inline --opt-out --output lib"
+  end
+
+  task :watch do
+    sh "fswatch -0 lib | xargs -n1 -0 rbs-inline --opt-out --output lib"
+  rescue Interrupt
+    # nop
+  end
+end

data/lib/rbs/inline/annotation_parser/tokenizer.rb

@@ -0,0 +1,361 @@
+module RBS
+  module Inline
+    class AnnotationParser
+      module Tokens
+        K_RETURN = :kRETURN
+        K_INHERITS = :kINHERITS
+        K_AS = :kAS
+        K_OVERRIDE = :kOVERRIDE
+        K_USE = :kUSE
+        K_MODULE_SELF = :kMODULESELF
+        K_GENERIC = :kGENERIC
+        K_IN = :kIN
+        K_OUT = :kOUT
+        K_UNCHECKED = :kUNCHECKED
+        K_SELF = :kSELF
+        K_SKIP = :kSKIP
+        K_YIELDS = :kYIELDS
+        K_MODULE = :kMODULE
+        K_CLASS = :kCLASS
+        K_COLON2 = :kCOLON2
+        K_COLON = :kCOLON
+        K_LBRACKET = :kLBRACKET
+        K_RBRACKET = :kRBRACKET
+        K_COMMA = :kCOMMA
+        K_STAR2 = :kSTAR2
+        K_STAR = :kSTAR
+        K_MINUS2 = :kMINUS2
+        K_LT = :kLT
+        K_DOT3 = :kDOT3
+        K_DOT = :kDOT
+        K_ARROW = :kARROW
+        K_LBRACE = :kLBRACE
+        K_LPAREN = :kLPAREN
+        K_AMP = :kAMP
+        K_QUESTION = :kQUESTION
+        K_VBAR = :kVBAR
+
+        K_EOF = :kEOF
+
+        # `@rbs!`
+        K_RBSE = :kRBSE
+
+        # `@rbs`
+        K_RBS = :kRBS
+
+        T_UIDENT = :tUIDENT
+        T_IFIDENT = :tIFIDENT
+        T_LVAR = :tLVAR
+
+        # The body of comment string following `--`
+        T_COMMENT = :tCOMMENT
+
+        # Type/method type source
+        T_SOURCE = :tSOURCE
+
+        # Block type source
+        T_BLOCKSTR = :tBLOCKSTR
+
+        # `!` local variable
+        T_ELVAR = :tELVAR
+
+        T_ATIDENT = :tATIDENT
+        T_ANNOTATION = :tANNOTATION
+        T_WHITESPACE = :tWHITESPACE
+      end
+
+      class Tokenizer
+        include Tokens
+
+        KEYWORDS = {
+          "return" => K_RETURN,
+          "inherits" => K_INHERITS,
+          "as" => K_AS,
+          "override" => K_OVERRIDE,
+          "use" => K_USE,
+          "module-self" => K_MODULE_SELF,
+          "generic" => K_GENERIC,
+          "in" => K_IN,
+          "out" => K_OUT,
+          "unchecked" => K_UNCHECKED,
+          "self" => K_SELF,
+          "skip" => K_SKIP,
+          "yields" => K_YIELDS,
+          "module" => K_MODULE,
+          "class" => K_CLASS,
+        } #: Hash[String, Symbol]
+        KW_RE = /#{Regexp.union(KEYWORDS.keys)}\b/
+
+        PUNCTS = {
+          "::" => K_COLON2,
+          ":" => K_COLON,
+          "[" => K_LBRACKET,
+          "]" => K_RBRACKET,
+          "," => K_COMMA,
+          "**" => K_STAR2,
+          "*" => K_STAR,
+          "--" => K_MINUS2,
+          "<" => K_LT,
+          "..." => K_DOT3,
+          "." => K_DOT,
+          "->" => K_ARROW,
+          "{" => K_LBRACE,
+          "(" => K_LPAREN,
+          "&" => K_AMP,
+          "?" => K_QUESTION,
+          "|" => K_VBAR,
+        } #: Hash[String, Symbol]
+        PUNCTS_RE = Regexp.union(PUNCTS.keys) #: Regexp
+
+        attr_reader :scanner #: StringScanner
+
+        # Tokens that comes after the current position
+        #
+        # This is a four tuple of tokens.
+        #
+        # 1. The first array is a trivia tokens before current position
+        # 2. The second token is the first lookahead token after the current position
+        # 3. The third array is a trivia tokens between the first lookahead and the second lookahead
+        # 4. The fourth token is the second lookahead token
+        #
+        attr_reader :lookahead_tokens #: [Array[token], token?, Array[token], token?]
+
+        # Token that comes after the current position
+        # @rbs %a{pure}
+        def lookahead1 #: token?
+          lookahead_tokens[1]
+        end
+
+        # Token that comes after `lookahead1`
+        # @rbs %a{pure}
+        def lookahead2 #: token?
+          lookahead_tokens[3]
+        end
+
+        # Returns the current char position of the first lookahead token
+        #
+        # ```
+        # __ foo ___ bar baz
+        # ^^                 Trivia tokens before lookahead1
+        #   ^                #current_position
+        #    ^^^             lookahead1
+        #        ^^^         Trivia tokens between lookahead1 and lookahead2
+        #            ^^^     lookahead2
+        #                ^    <= scanner.charpos
+        # ```
+        #
+        def current_position #: Integer
+          start = scanner.charpos
+          start -= lookahead1[1].size if lookahead1
+          lookahead_tokens[2].each {|_, s| start -= s.size }
+          start -= lookahead2[1].size if lookahead2
+          start
+        end
+
+        def lookaheads #: Array[Symbol?]
+          [lookahead1&.[](0), lookahead2&.[](0)]
+        end
+
+        # @rbs scanner: StringScanner
+        # @rbs return: void
+        def initialize(scanner)
+          @scanner = scanner
+
+          @lookahead_tokens = [[], nil, [], nil]
+        end
+
+        # Advances the scanner
+        #
+        # @rbs tree: AST::Tree -- Tree to insert trivia tokens
+        # @rbs eat: bool -- true to add the current lookahead token into the tree
+        # @rbs return: void
+        def advance(tree, eat: false)
+          consume_trivias(tree)
+          last = lookahead_tokens[1]
+          tree << last if eat
+
+          lookahead_tokens[0].replace(lookahead_tokens[2])
+          lookahead_tokens[1] = lookahead_tokens[3]
+          lookahead_tokens[2].clear
+
+          while s = scanner.scan(/\s+/)
+            lookahead_tokens[2] << [T_WHITESPACE, s]
+          end
+
+          lookahead =
+            case
+            when scanner.eos?
+              [K_EOF, ""]
+            when s = scanner.scan(/@rbs!/)
+              [K_RBSE, s]
+            when s = scanner.scan(/@rbs\b/)
+              [K_RBS, s]
+            when s = scanner.scan(PUNCTS_RE)
+              [PUNCTS.fetch(s), s]
+            when s = scanner.scan(KW_RE)
+              [KEYWORDS.fetch(s), s]
+            when s = scanner.scan(/[A-Z]\w*/)
+              [T_UIDENT, s]
+            when s = scanner.scan(/_[A-Z]\w*/)
+              [T_IFIDENT, s]
+            when s = scanner.scan(/[a-z]\w*/)
+              [T_LVAR, s]
+            when s = scanner.scan(/![a-z]\w*/)
+              [T_ELVAR, s]
+            when s = scanner.scan(/@\w+/)
+              [T_ATIDENT, s]
+            when s = scanner.scan(/%a\{[^}]+\}/)
+              [T_ANNOTATION, s]
+            when s = scanner.scan(/%a\[[^\]]+\]/)
+              [T_ANNOTATION, s]
+            when s = scanner.scan(/%a\([^)]+\)/)
+              [T_ANNOTATION, s]
+            end #: token?
+
+          lookahead_tokens[3] = lookahead
+
+          last
+        end
+
+        # @rbs (AST::Tree?) -> String
+        def consume_trivias(tree)
+          buf = +""
+
+          lookahead_tokens[0].each do |tok|
+            tree << tok if tree
+            buf << tok[1]
+          end
+          lookahead_tokens[0].clear
+
+          buf
+        end
+
+        # Returns true if the scanner cannot consume next token
+        def stuck? #: bool
+          lookahead1.nil? && lookahead2.nil?
+        end
+
+        # Skips characters
+        #
+        # This method ensures the `current_position` will be the given `position`.
+        #
+        # @rbs position: Integer -- The new position
+        # @rbs tree: AST::Tree -- Tree to insert trivia tokens
+        # @rbs return: void
+        def reset(position, tree)
+          if scanner.charpos > position
+            scanner.reset()
+          end
+
+          skips = position - scanner.charpos
+
+          if scanner.rest_size < skips
+            raise "The position is bigger than the size of the rest of the input: input size=#{scanner.string.size}, position=#{position}"
+          end
+
+          scanner.skip(/.{#{skips}}/)
+
+          @lookahead_tokens = [[], nil, [], nil]
+
+          advance(tree)
+          advance(tree)
+        end
+
+        def rest #: String
+          buf = +""
+          lookahead_tokens[0].each {|_, s| buf << s }
+          buf << lookahead1[1] if lookahead1
+          lookahead_tokens[2].each {|_, s| buf << s }
+          buf << lookahead2[1] if lookahead2
+          buf << scanner.rest
+          buf
+        end
+
+        # Consume given token type and inserts the token to the tree or `nil`
+        #
+        # @rbs *types: Symbol
+        # @rbs tree: AST::Tree
+        # @rbs return: void
+        def consume_token(*types, tree:)
+          if type?(*types)
+            advance(tree, eat: true)
+          else
+            tree << nil
+          end
+        end
+
+        # Consume given token type and inserts the token to the tree or raise
+        #
+        # @rbs *types: Symbol
+        # @rbs tree: AST::Tree
+        # @rbs return: void
+        def consume_token!(*types, tree:)
+          type!(*types)
+          advance(tree, eat: true)
+        end
+
+        # Test if current token has specified `type`
+        #
+        # @rbs *types: Symbol
+        # @rbs return: bool
+        def type?(*types)
+          types.any? { lookahead1 && lookahead1[0] == _1 }
+        end
+
+        # Test if lookahead2 token have specified `type`
+        #
+        # @rbs *types: Symbol -- The type of the lookahead2 token
+        # @rbs return: bool
+        def type2?(*types)
+          types.any? { lookahead2 && lookahead2[0] == _1 }
+        end
+
+        # Ensure current token is one of the specified in types
+        #
+        # @rbs *types: Symbol
+        # @rbs return: void
+        def type!(*types)
+          raise "Unexpected token: #{lookahead1&.[](0)}, where expected token: #{types.join(",")}" unless type?(*types)
+        end
+
+        # Reset the current_token to incoming comment `--`
+        #
+        # Reset to the end of the input if `--` token cannot be found.
+        #
+        # @rbs return: String -- String that is skipped
+        def skip_to_comment
+          prefix = +""
+
+          lookahead_tokens[0].each { prefix << _1[1] }
+          lookahead_tokens[0].clear
+
+          if type?(K_MINUS2)
+            return prefix
+          end
+
+          prefix << lookahead1[1] if lookahead1
+          lookahead_tokens[2].each { prefix << _1[1] }
+          lookahead_tokens[2].clear
+
+          if type2?(K_MINUS2)
+            advance(_ = nil)  # The tree is unused because no trivia tokens are left
+            return prefix
+          end
+
+          prefix << lookahead2[1] if lookahead2
+
+          if string = scanner.scan_until(/--/)
+            @lookahead_tokens = [[], nil, [], [K_MINUS2, "--"]]
+            advance(_ = nil)  # The tree is unused because no trivia tokens are left
+            prefix + string.delete_suffix("--")
+          else
+            s = scanner.rest
+            @lookahead_tokens = [[], [K_EOF, ""], [], nil]
+            scanner.terminate
+            prefix + s
+          end
+        end
+      end
+    end
+  end
+end