syntax_tree-bf 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: ddb9a72bfa7b2fd5f6960214c364bf2dea81ecd90f4512187280fca93a0e086c
+  data.tar.gz: b6c92797a50f0a94b160aa5d4e2ccccd81472a0b770a79c2c7e7bccad47c166c
+SHA512:
+  metadata.gz: 30f416c5e87cdafd9f088655ab4f0eac4bdaa99ce8bc0a10cc492435fb7b03fbca87c0e461147c94d7a9004bface66c21d0927441cb8bf1e98b8be8775428ed5
+  data.tar.gz: e3f09df44d161a2212ab2e6075e0f2b77457fdf4e2b3988886b126287a93c9ea76b82133659a87a32439bd038e52c89b4a8b978a6d5672b92cbf20a9fddb203f

data/.github/dependabot.yml

@@ -0,0 +1,6 @@
+version: 2
+updates:
+  - package-ecosystem: "bundler"
+    directory: "/"
+    schedule:
+      interval: "daily"

data/.github/workflows/main.yml

@@ -0,0 +1,34 @@
+name: Main
+on:
+- push
+- pull_request_target
+jobs:
+  ci:
+    name: CI
+    runs-on: ubuntu-latest
+    env:
+      CI: true
+    steps:
+    - uses: actions/checkout@master
+    - uses: ruby/setup-ruby@v1
+      with:
+        bundler-cache: true
+        ruby-version: '3.1'
+    - name: Test
+      run: |
+        bundle exec rake test
+        bundle exec rake stree:check
+  automerge:
+    name: AutoMerge
+    needs: ci
+    runs-on: ubuntu-latest
+    if: github.event_name == 'pull_request_target' && github.actor == 'dependabot[bot]'
+    steps:
+    - uses: actions/github-script@v3
+      with:
+        script: |
+          github.pulls.merge({
+            owner: context.payload.repository.owner.login,
+            repo: context.payload.repository.name,
+            pull_number: context.payload.pull_request.number
+          })

data/.gitignore

@@ -0,0 +1,10 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+test.bf

data/CHANGELOG.md

@@ -0,0 +1,16 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/) and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).
+
+## [Unreleased]
+
+## [0.1.0] - 2022-05-26
+
+### Added
+
+- 🎉 Initial release! 🎉
+
+[unreleased]: https://github.com/ruby-syntax-tree/syntax_tree-bf/compare/v0.1.0...HEAD
+[0.1.0]: https://github.com/ruby-syntax-tree/syntax_tree-bf/compare/30c324...v0.1.0

data/Gemfile

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+gemspec

data/Gemfile.lock

@@ -0,0 +1,36 @@
+PATH
+  remote: .
+  specs:
+    syntax_tree-bf (0.1.0)
+      prettier_print
+      syntax_tree (>= 2.0.1)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    docile (1.4.0)
+    minitest (5.15.0)
+    prettier_print (0.1.0)
+    rake (13.0.6)
+    simplecov (0.21.2)
+      docile (~> 1.1)
+      simplecov-html (~> 0.11)
+      simplecov_json_formatter (~> 0.1)
+    simplecov-html (0.12.3)
+    simplecov_json_formatter (0.1.4)
+    syntax_tree (2.7.1)
+      prettier_print
+
+PLATFORMS
+  x86_64-darwin-21
+  x86_64-linux
+
+DEPENDENCIES
+  bundler
+  minitest
+  rake
+  simplecov
+  syntax_tree-bf!
+
+BUNDLED WITH
+   2.3.6

data/LICENSE

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2022-present Kevin Newton
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,76 @@
+# SyntaxTree::Bf
+
+[![Build Status](https://github.com/ruby-syntax-tree/syntax_tree-bf/actions/workflows/main.yml/badge.svg)](https://github.com/ruby-syntax-tree/syntax_tree-bf/actions/workflows/main.yml)
+[![Gem Version](https://img.shields.io/gem/v/syntax_tree-bf.svg)](https://rubygems.org/gems/syntax_tree-bf)
+
+[Syntax Tree](https://github.com/ruby-syntax-tree/syntax_tree) support for Brainf***.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem "syntax_tree-bf"
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install syntax_tree-bf
+
+## Usage
+
+From code:
+
+```ruby
+require "syntax_tree/bf"
+
+pp SyntaxTree::Bf.parse(source) # print out the AST
+puts SyntaxTree::Bf.format(source) # format the AST
+```
+
+From the CLI:
+
+```sh
+$ stree ast --plugins=bf file.bf
+(root
+  (increment),
+  ...
+  (increment),
+  (loop
+    (shift_right),
+    ...
+    (decrement)
+  ),
+  (shift_right),
+  ...
+  (output)
+)
+```
+
+or
+
+```sh
+$ stree format --plugins=bf file.bf
+++++++++[
+  >++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-
+]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.
+```
+
+or
+
+```sh
+$ stree write --plugins=bf file.bf
+file.bf 1ms
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/ruby-syntax-tree/syntax_tree-bf.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rake/testtask"
+require "syntax_tree/rake_tasks"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/*_test.rb"]
+end
+
+source_files = FileList["{lib,test}/**/*.rb"]
+SyntaxTree::Rake::CheckTask.new { |t| t.source_files = source_files }
+SyntaxTree::Rake::WriteTask.new { |t| t.source_files = source_files }
+
+task default: :test

data/exe/bf

@@ -0,0 +1,6 @@
+#!/usr/bin/env ruby
+
+$:.unshift(File.expand_path("../lib", __dir__))
+require "syntax_tree/bf"
+
+SyntaxTree::Bf::Evaluate.run(ARGF.read)

data/lib/syntax_tree/bf/evaluate.rb

@@ -0,0 +1,113 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    module Evaluate
+      # Takes a bf syntax tree and compiles it down to a simple bytecode. The
+      # instructions almost entirely map to the tree nodes except:
+      #
+      # * Root - replaced by its contents
+      # * Loop - replaced by a jmz (jump if zero) and a jmp (unconditional jump)
+      #
+      class Compiler < Visitor
+        attr_reader :insns
+
+        def initialize
+          @insns = []
+        end
+
+        def visit_root(node)
+          super
+        end
+
+        def visit_loop(node)
+          index = insns.length
+          insns << [:jmz, -1]
+
+          super
+
+          insns << [:jmp, index]
+          insns[index][1] = insns.length
+        end
+
+        def visit_increment(node)
+          insns << [:inc]
+        end
+
+        def visit_decrement(node)
+          insns << [:dec]
+        end
+
+        def visit_shift_right(node)
+          insns << [:shr]
+        end
+
+        def visit_shift_left(node)
+          insns << [:shl]
+        end
+
+        def visit_input(node)
+          insns << [:inp]
+        end
+
+        def visit_output(node)
+          insns << [:out]
+        end
+      end
+
+      # This is the virtual machine that runs the set of instructions that the
+      # compiler outputs. Its state is kept on an infinite tape of memory, which
+      # is paired with a cursor.
+      class Machine
+        attr_reader :insns, :stdin, :stdout
+
+        def initialize(insns, stdin: STDIN, stdout: STDOUT)
+          @insns = insns
+          @stdin = stdin
+          @stdout = stdout
+        end
+
+        def run
+          pc = 0
+
+          tape = Hash.new { 0 }
+          cursor = 0
+
+          while pc < insns.length
+            insn = insns[pc]
+            pc += 1
+
+            case insn
+            in [:inc]
+              tape[cursor] += 1
+            in [:dec]
+              tape[cursor] -= 1
+            in [:shr]
+              cursor += 1
+            in [:shl]
+              cursor -= 1
+            in [:inp]
+              tape[cursor] = stdin.getc.ord
+            in [:out]
+              stdout.putc(tape[cursor].chr)
+            in [:jmz, offset]
+              pc = offset if tape[cursor] == 0
+            in [:jmp, offset]
+              pc = offset
+            end
+          end
+
+          tape
+        end
+      end
+
+      def self.run(source, stdin: STDIN, stdout: STDOUT)
+        node = Parser.new(source).parse
+        compiler = Compiler.new
+
+        compiler.visit(node)
+        Machine.new(compiler.insns, stdin: stdin, stdout: stdout).run
+      end
+    end
+  end
+end

data/lib/syntax_tree/bf/format.rb

@@ -0,0 +1,54 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    class Format < Visitor
+      attr_reader :q
+
+      def initialize(q)
+        @q = q
+      end
+
+      def visit_root(node)
+        super
+        q.breakable(force: true)
+      end
+
+      def visit_loop(node)
+        q.group do
+          q.text("[")
+          q.nest(2) do
+            q.breakable("")
+            super
+          end
+          q.breakable("")
+          q.text("]")
+        end
+      end
+
+      def visit_increment(node)
+        q.text("+")
+      end
+
+      def visit_decrement(node)
+        q.text("-")
+      end
+
+      def visit_shift_right(node)
+        q.text(">")
+      end
+
+      def visit_shift_left(node)
+        q.text("<")
+      end
+
+      def visit_input(node)
+        q.text(",")
+      end
+
+      def visit_output(node)
+        q.text(".")
+      end
+    end
+  end
+end

data/lib/syntax_tree/bf/nodes.rb

@@ -0,0 +1,201 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    class Node
+      def format(q)
+        Format.new(q).visit(self)
+      end
+
+      def pretty_print(q)
+        PrettyPrint.new(q).visit(self)
+      end
+    end
+
+    # The root node of the syntax tree.
+    class Root < Node
+      attr_reader :nodes, :location
+
+      def initialize(nodes:, location:)
+        @nodes = nodes
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_root(self)
+      end
+
+      def child_nodes
+        nodes
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { nodes: nodes, location: location }
+      end
+    end
+
+    # [ ... ]
+    class Loop < Node
+      attr_reader :nodes, :location
+
+      def initialize(nodes:, location:)
+        @nodes = nodes
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_loop(self)
+      end
+
+      def child_nodes
+        nodes
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { nodes: nodes, location: location }
+      end
+    end
+
+    # +
+    class Increment < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_increment(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: "+", location: location }
+      end
+    end
+
+    # -
+    class Decrement < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_decrement(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: "-", location: location }
+      end
+    end
+
+    # >
+    class ShiftRight < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_shift_right(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: ">", location: location }
+      end
+    end
+
+    # <
+    class ShiftLeft < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_shift_left(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: "<", location: location }
+      end
+    end
+
+    # ,
+    class Input < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_input(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: ",", location: location }
+      end
+    end
+
+    # .
+    class Output < Node
+      attr_reader :location
+
+      def initialize(location:)
+        @location = location
+      end
+
+      def accept(visitor)
+        visitor.visit_output(self)
+      end
+
+      def child_nodes
+        []
+      end
+
+      alias deconstruct child_nodes
+
+      def deconstruct_keys(keys)
+        { value: ".", location: location }
+      end
+    end
+  end
+end

data/lib/syntax_tree/bf/parser.rb

@@ -0,0 +1,83 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    # Parses the given source code into a syntax tree.
+    class Parser
+      class Error < StandardError
+      end
+
+      attr_reader :source
+
+      def initialize(source)
+        @source = source
+      end
+
+      def parse
+        Root.new(nodes: parse_segment(source, 0), location: 0...source.length)
+      end
+
+      private
+
+      def parse_segment(segment, offset)
+        index = 0
+        nodes = []
+
+        while index < segment.length
+          location = offset + index
+
+          case segment[index]
+          when "+"
+            nodes << Increment.new(location: location...(location + 1))
+            index += 1
+          when "-"
+            nodes << Decrement.new(location: location...(location + 1))
+            index += 1
+          when ">"
+            nodes << ShiftRight.new(location: location...(location + 1))
+            index += 1
+          when "<"
+            nodes << ShiftLeft.new(location: location...(location + 1))
+            index += 1
+          when "."
+            nodes << Output.new(location: location...(location + 1))
+            index += 1
+          when ","
+            nodes << Input.new(location: location...(location + 1))
+            index += 1
+          when "["
+            matched = 1
+            end_index = index + 1
+
+            while matched != 0 && end_index < segment.length
+              case segment[end_index]
+              when "["
+                matched += 1
+              when "]"
+                matched -= 1
+              end
+
+              end_index += 1
+            end
+
+            raise Error, "Unmatched start loop" if matched != 0
+
+            content = segment[(index + 1)...(end_index - 1)]
+            nodes << Loop.new(
+              nodes: parse_segment(content, offset + index + 1),
+              location: location...(offset + end_index)
+            )
+
+            index = end_index
+          when "]"
+            raise Error, "Unmatched end loop"
+          else
+            index += 1
+          end
+        end
+
+        nodes
+      end
+    end
+  end
+end

data/lib/syntax_tree/bf/pretty_print.rb

@@ -0,0 +1,65 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    class PrettyPrint < Visitor
+      attr_reader :q
+
+      def initialize(q)
+        @q = q
+      end
+
+      def visit_root(node)
+        visit_node("root", node)
+      end
+
+      def visit_loop(node)
+        visit_node("loop", node)
+      end
+
+      def visit_increment(node)
+        visit_node("increment", node)
+      end
+
+      def visit_decrement(node)
+        visit_node("decrement", node)
+      end
+
+      def visit_shift_right(node)
+        visit_node("shift_right", node)
+      end
+
+      def visit_shift_left(node)
+        visit_node("shift_left", node)
+      end
+
+      def visit_input(node)
+        visit_node("input", node)
+      end
+
+      def visit_output(node)
+        visit_node("output", node)
+      end
+
+      private
+
+      def visit_node(name, node)
+        q.group do
+          q.text("(")
+          q.text(name)
+
+          if node.child_nodes.any?
+            q.nest(2) do
+              q.breakable
+              q.seplist(node.child_nodes) { |child_node| visit(child_node) }
+            end
+
+            q.breakable("")
+          end
+
+          q.text(")")
+        end
+      end
+    end
+  end
+end

data/lib/syntax_tree/bf/version.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    VERSION = "0.1.0"
+  end
+end

data/lib/syntax_tree/bf/visitor.rb

@@ -0,0 +1,43 @@
+# frozen_string_literal: true
+
+module SyntaxTree
+  module Bf
+    class Visitor
+      def visit(node)
+        node.accept(self)
+      end
+
+      def visit_all(nodes)
+        nodes.map { |node| visit(node) }
+      end
+
+      def visit_child_nodes(node)
+        visit_all(node.child_nodes)
+      end
+
+      # Visit a Root node.
+      alias visit_root visit_child_nodes
+
+      # Visit a Loop node.
+      alias visit_loop visit_child_nodes
+
+      # Visit an Increment node.
+      alias visit_increment visit_child_nodes
+
+      # Visit a Decrement node.
+      alias visit_decrement visit_child_nodes
+
+      # Visit a ShiftRight node.
+      alias visit_shift_right visit_child_nodes
+
+      # Visit a ShiftLeft node.
+      alias visit_shift_left visit_child_nodes
+
+      # Visit an Input node.
+      alias visit_input visit_child_nodes
+
+      # Visit an Output node.
+      alias visit_output visit_child_nodes
+    end
+  end
+end

data/lib/syntax_tree/bf.rb

@@ -0,0 +1,30 @@
+# frozen_string_literal: true
+
+require "prettier_print"
+require "syntax_tree"
+
+require_relative "bf/nodes"
+require_relative "bf/parser"
+require_relative "bf/visitor"
+
+require_relative "bf/evaluate"
+require_relative "bf/format"
+require_relative "bf/pretty_print"
+
+module SyntaxTree
+  module Bf
+    def self.format(source, maxwidth = 80)
+      PrettierPrint.format(+"", maxwidth) { |q| parse(source).format(q) }
+    end
+
+    def self.parse(source)
+      Parser.new(source).parse
+    end
+
+    def self.read(source)
+      File.read(source)
+    end
+  end
+
+  register_handler(".bf", Bf)
+end

data/syntax_tree-bf.gemspec

@@ -0,0 +1,33 @@
+# frozen_string_literal: true
+
+require_relative "lib/syntax_tree/bf/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "syntax_tree-bf"
+  spec.version       = SyntaxTree::Bf::VERSION
+  spec.authors       = ["Kevin Newton"]
+  spec.email         = ["kddnewton@gmail.com"]
+
+  spec.summary       = "Syntax Tree support for Brainf***"
+  spec.homepage      = "https://github.com/ruby-syntax-tree/syntax_tree-bf"
+  spec.license       = "MIT"
+  spec.metadata      = { "rubygems_mfa_required" => "true" }
+
+  spec.files         = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      f.match(%r{^(test|spec|features)/})
+    end
+  end
+
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = %w[lib]
+
+  spec.add_dependency "prettier_print"
+  spec.add_dependency "syntax_tree", ">= 2.0.1"
+
+  spec.add_development_dependency "bundler"
+  spec.add_development_dependency "minitest"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "simplecov"
+end

metadata

@@ -0,0 +1,148 @@
+--- !ruby/object:Gem::Specification
+name: syntax_tree-bf
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Kevin Newton
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2022-05-26 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: prettier_print
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: syntax_tree
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.0.1
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.0.1
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description:
+email:
+- kddnewton@gmail.com
+executables:
+- bf
+extensions: []
+extra_rdoc_files: []
+files:
+- ".github/dependabot.yml"
+- ".github/workflows/main.yml"
+- ".gitignore"
+- CHANGELOG.md
+- Gemfile
+- Gemfile.lock
+- LICENSE
+- README.md
+- Rakefile
+- exe/bf
+- lib/syntax_tree/bf.rb
+- lib/syntax_tree/bf/evaluate.rb
+- lib/syntax_tree/bf/format.rb
+- lib/syntax_tree/bf/nodes.rb
+- lib/syntax_tree/bf/parser.rb
+- lib/syntax_tree/bf/pretty_print.rb
+- lib/syntax_tree/bf/version.rb
+- lib/syntax_tree/bf/visitor.rb
+- syntax_tree-bf.gemspec
+homepage: https://github.com/ruby-syntax-tree/syntax_tree-bf
+licenses:
+- MIT
+metadata:
+  rubygems_mfa_required: 'true'
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.3.3
+signing_key:
+specification_version: 4
+summary: Syntax Tree support for Brainf***
+test_files: []