fam 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 80a521187255f27791f45b197a66fa69160a5d37cb2d6599a59d7001fd2b86ff
+  data.tar.gz: 25f69d87e3148bc616964bcc15287c5b6fd6406548251a730a5b48abaddef081
+SHA512:
+  metadata.gz: 570f5e1160997bdcd2f8e9aa15d81068cef6b5bc94ec2483715baa3d25b5af90840375d2ef546a793aad728ce8e89a93224a70fc71ebf5af657759160de5bb78
+  data.tar.gz: 7675fc3184c4210a21f47cc2a35991a40faccbd1bd9f1953ab2d8a8ca3da258511b305d45b73306b1c9a3a0223d5a1353439bd64a0c82d99222eff798d699e61

data/LICENSE

@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.

data/README.md

@@ -0,0 +1,2 @@
+# FAM
+A very Fake Assembly(ish-language) Machine thingy...

data/bin/fam

@@ -0,0 +1,23 @@
+#!/usr/bin/env ruby
+
+require 'fam'
+
+$VERBOSE = false
+$CLOCK = $VERBOSE ? 20 : Float::INFINITY
+
+file_names = ARGV.select { |file| file.include? '.fam'}
+lexed = FAM::Syntax::Lexer.lex file_names[-1]
+puts lexed if $VERBOSE
+puts if $VERBOSE
+
+parsed = FAM::Syntax::Parser.parse lexed.tokens
+AST = parsed.ast
+pp AST if $VERBOSE
+
+MEM = FAM::Machine::RAM.new '100B'
+CPU = FAM::Machine::CPU.new MEM
+puts if $VERBOSE
+
+CPU.run AST do |pc|
+  puts "Program counter: #{pc}" if $VERBOSE
+end

data/lib/fam.rb

@@ -0,0 +1,16 @@
+class Object
+  def base_name
+    self.class.name.split(/(\:\:)|(\.)/)[-1]
+  end
+end
+
+module FAM
+  VERSIONS = { :major => 0, :minor => 0, :tiny => 1 }
+
+  def self.version *args
+    VERSIONS.flatten.select.with_index { |val, i| i.odd? }.join '.'
+  end
+end
+
+Dir["#{File.dirname __FILE__}/fam/*.rb"].each    { |f| require f }
+Dir["#{File.dirname __FILE__}/fam/**/*.rb"].each { |f| require f }

data/lib/fam/error.rb

@@ -0,0 +1,35 @@
+class String
+  def black;   "\e[30m#{self}\e[0m"; end
+  def red;     "\e[31m#{self}\e[0m"; end
+  def green;   "\e[32m#{self}\e[0m"; end
+  def brown;   "\e[33m#{self}\e[0m"; end
+  def blue;    "\e[34m#{self}\e[0m"; end
+  def magenta; "\e[35m#{self}\e[0m"; end
+  def cyan;    "\e[36m#{self}\e[0m"; end
+  def gray;    "\e[37m#{self}\e[0m"; end
+
+  def bg_black;   "\e[40m#{self}\e[0m"; end
+  def bg_red;     "\e[41m#{self}\e[0m"; end
+  def bg_green;   "\e[42m#{self}\e[0m"; end
+  def bg_brown;   "\e[43m#{self}\e[0m"; end
+  def bg_blue;    "\e[44m#{self}\e[0m"; end
+  def bg_magenta; "\e[45m#{self}\e[0m"; end
+  def bg_cyan;    "\e[46m#{self}\e[0m"; end
+  def bg_gray;    "\e[47m#{self}\e[0m"; end
+
+  def bold;          "\e[1m#{self}\e[22m"; end
+  def italic;        "\e[3m#{self}\e[23m"; end
+  def underline;     "\e[4m#{self}\e[24m"; end
+  def blink;         "\e[5m#{self}\e[25m"; end
+  def reverse_color; "\e[7m#{self}\e[27m"; end
+end
+
+def UnexpectedToken token
+   puts "\nUnexpected token type: '#{token.type}', at line: #{token.line}:#{token.col}".red.bold
+   exit 1
+end
+
+def ExpectedToken name, token
+   puts "\nExpected token: '#{name}', instead got: '#{token}' at line: #{token.line}:#{token.col}".red.bold
+   exit 1
+end

data/lib/fam/machine/cpu.rb

@@ -0,0 +1,174 @@
+require_relative 'memory'
+require_relative '../syntax/ast'
+
+module FAM::Machine
+  class CPU
+    include FAM::Syntax
+    attr_reader :ram, :registers, :memory_aliases, :labels
+
+    def initialize ram
+      @ram = ram
+      @registers = {
+        :ACC => 0,
+        :DAT => 0,
+        :PC  => 0
+      }
+      @memory_aliases = Hash.new
+
+      @labels = Hash.new
+      @last_jump = nil
+      @back_index = 0
+    end
+
+    def self.quick_run ram, parsed, &block
+      cpu = self.new ram
+      if block_given?
+        cpu.run parsed, &block
+      else
+        cpu.run parsed
+      end
+      cpu
+    end
+
+    def run parsed, &block
+      @block = block if block_given?
+      @parsed = parsed
+
+      @tree_index = -1
+      while @tree_index < parsed.tree.size
+        @tree_index += 1
+
+        sleep 1.0 / $CLOCK
+        node = parsed[@tree_index]
+        status = execute node
+        break if status == :STOP
+        next  if status == :SKIP
+        puts "\n  _BACK: #{parsed[@back_index].inspect}\n " if $VERBOSE
+        display if $VERBOSE
+      end
+    end
+
+    def execute node
+      @registers[:PC] = @tree_index
+      @block.call @registers[:PC] unless @block.nil?
+      case node
+      when AST::LabelNode
+        @last_jump = node.label
+        @labels[node.label] = @tree_index
+        @back_index = @tree_index
+      when AST::HaltNode
+        return :STOP
+      when AST::GotoNode
+        back = @tree_index
+        if @labels.include? node.ident.name
+          @tree_index = @labels[node.ident.name]
+        elsif node.ident.name == '_BACK'
+          @tree_index = @back_index
+          return :PASS
+        else  # Search ahead
+          found = false
+          @parsed.tree.each.with_index do |top_node, i|
+            @tree_index = i
+            if top_node.base_name == 'LabelNode'
+              (found = true; break) if top_node.label == node.ident.name
+            end
+          end
+          abort "Label: `#{node.label.name}` was not found. Execution HALTED!".red.bold unless found
+        end
+        @last_jump = node.ident.name
+        @back_index = back
+      when AST::StoreNode
+        mem_index = case node.to
+        when AST::AddressNode
+          node.to.address
+        when AST::IdentNode
+          @memory_aliases[node.to.name]
+        end
+        @ram[mem_index] = get_value node, node.value
+      when AST::LoadNode
+        @registers[node.register.register.to_sym] = get_value node, node.value
+      when AST::DataNode
+        initial_value = get_value node, node.initial
+        free_index = nil
+        @ram.array.each.with_index { |value, i| if value == NULL then free_index = i; break; end }
+        abort ("No free memory, allocation of `#{node.name.name}`,\n" +
+        "cannot happen! Execution HALTED!").red.bold if free_index.nil?
+        @memory_aliases[node.name.name] = free_index
+        @ram[free_index] = initial_value
+      when AST::InNode
+        @registers[node.register.register.to_sym] = cpu_input
+      when AST::OutNode, AST::AsciiNode
+        value = get_value node, node.value
+        cpu_output value, (node.base_name == 'OutNode' ? :PLAIN : :ASCII)
+      when AST::SubNode, AST::AddNode, AST::MulNode, AST::DivNode, AST::ModNode
+        value = get_value node, node.value
+        ExpectedNode 'REGISTER', node.to unless node.to.base_name == 'RegisterNode'
+        if node.base_name[/Sub|Add/]
+          @registers[node.to.register.to_sym] += value * (node.base_name == 'AddNode' ? 1 : -1)
+        elsif node.base_name == 'Mul'
+          @registers[node.to.register.to_sym] *= value
+        elsif node.base_name == 'Div'
+          @registers[node.to.register.to_sym] /= value
+        else
+          @registers[node.to.register.to_sym] %= value
+        end
+      when AST::EqualNode, AST::MoreNode, AST::LessNode
+        left  = get_value node, node.left
+        right = get_value node, node.right
+        if node.base_name == 'EqualNode' ? (left == right) : (node.base_name == 'MoreNode' ? (left > right) : (left < right))
+          execute node.valid
+        else
+          execute node.invalid
+        end
+      else
+        print "\n" * (@ram.to_s.count("\n") + 1) if $VERBOSE
+        abort ("Unknown Node: `#{node.base_name}`,\nparser generated an " +
+        "unexecutable/unknown node... Execution HALTED!").red.bold
+      end
+      return :PASS
+    end
+
+    def display
+      puts "#{@ram.to_s}"
+      puts
+      @registers.each { |key, value| print "#{key} => #{value}\n" }
+      puts
+      # print "\033[F" * (self.to_s.count("\n"))
+      # print "\n" * (@ram.to_s.count("\n") + 1)
+    end
+
+    def cpu_input  # Ment to be changed
+      print 'INPUT: '
+      $stdin.gets.to_i
+    end
+
+    def cpu_output out, ascii=:PLAIN  # Ment to be changed
+      puts "OUTPUT: #{ascii != :PLAIN ? out.chr : out }"
+    end
+
+    private def get_value super_value, value_node
+      case value_node
+      when AST::NumericNode
+        value_node.numeric
+      when AST::AddressNode
+        @ram[value_node.address]
+      when AST::RegisterNode
+        @registers[value_node.register.to_sym]
+      when AST::IdentNode
+        @ram[@memory_aliases[value_node.name]]
+      else
+        AST::UnexpectedNode super_value, value_node
+      end
+    end
+
+    private def UnexpectedNode node, sub_node
+      print "\n" * (@ram.to_s.count("\n") + 1) if $VERBOSE
+      abort ("Unexpected Node, you've given `#{sub_node.base_name}` AST::to Node: `#{node.base_name}`?").red.bold
+    end
+
+    private def ExpectedNode expect, got
+      print "\n" * (@ram.to_s.count("\n") + 1) if $VERBOSE
+      abort ("Expected: `#{expect}`, but insted got: `#{got}`").red.bold
+    end
+  end
+end

data/lib/fam/machine/memory.rb

@@ -0,0 +1,59 @@
+SIZES = {
+  :B => 1e0, :kB => 1e3, :MB => 1e6,
+  :GB => 1e9, :TB => 1e12
+}
+
+class NULL < NilClass
+  def to_s *args; 'NULL'; end
+end
+
+module FAM::Machine
+  class RAM
+    attr_accessor :array
+
+    def initialize size
+      alloc = 0
+      case size
+      when Numeric
+        alloc = size
+      when String
+        suffix = size.upcase[/[A-Z]+/]
+        suffix = 'kB' if suffix == 'KB'
+        unless suffix.empty?
+          alloc = size[/[0-9]+/].to_i * SIZES[suffix.to_sym]
+        else
+          alloc = size.to_i
+        end
+      else
+        abort 'ERROR: `size` argument must be a string or numeric!'.red
+      end
+      @array = Array.new(alloc, NULL)
+    end
+
+    def [](i)
+      @array[i]
+    end
+
+    def []=(i, value)
+      abort 'ERROR: Only integers can be stored in memory!' unless i.class == Integer
+      @array[i] = value
+    end
+
+    def to_s
+      result = String.new
+      width = %x{ tput cols }.to_i
+      i = j = 0
+      loop do
+        break if j >= @array.size
+        line = String.new
+        i = j
+        while line.size < width && j <= @array.size
+          line << "#{@array[j].to_s.rjust 4, '0'}XXXXX" # `X` padding
+          j += 1
+        end
+        result << "| #{@array[i..j].map {|e| e.to_s.rjust 4, '0'}.join ' | '} |\n"
+      end
+      result
+    end
+  end
+end

data/lib/fam/syntax/ast.rb

@@ -0,0 +1,141 @@
+module FAM::Syntax::AST
+  class Node
+    def to_s
+      "<#{self.class.name.split('Node')[0]} :: NODE>"
+    end
+  end
+
+  class SyntaxTree
+    attr_reader :tree
+
+    def initialize
+      @tree = []
+    end
+
+    def <<(node)
+      @tree << node
+    end
+
+    def [](i)
+      @tree[i]
+    end
+  end
+
+  class LabelNode < Node
+    attr_accessor :label
+    def initialize label
+      @label = label.name[0..-2]
+    end
+  end
+
+  class GotoNode < Node
+    attr_accessor :ident
+    def initialize ident
+      @ident = ident
+    end
+  end
+
+  class HaltNode < Node
+    attr_accessor :status
+    def initialize status
+      @status = status
+    end
+  end
+
+  class StoreNode < Node
+    attr_accessor :value, :to
+    def initialize value, to
+      @value = value
+      @to = to
+    end
+  end
+
+  class LoadNode < Node
+    attr_accessor :value, :register
+    def initialize value, register
+      @value = value
+      @register = register
+    end
+  end
+
+  class DataNode < Node
+    attr_accessor :name, :initial
+    def initialize name, initial
+      @name = name
+      @initial = initial
+    end
+  end
+
+  class InNode < Node
+    attr_accessor :register
+    def initialize reg
+      @register = reg
+    end
+  end
+
+  class OutputNode < Node
+    attr_accessor :value
+    def initialize value
+      @value = value
+    end
+  end
+
+  class OutNode   < OutputNode; end
+  class AsciiNode < OutputNode; end
+
+  class ArithmeticNode < Node
+    attr_accessor :value, :to
+    def initialize value, to
+      @value = value
+      @to = to
+    end
+  end
+
+  class AddNode < ArithmeticNode; end
+  class SubNode < ArithmeticNode; end
+  class MulNode < ArithmeticNode; end
+  class DivNode < ArithmeticNode; end
+  class ModNode < ArithmeticNode; end
+
+  class ConditionNode < Node
+    attr_accessor :left, :right, :valid, :invalid
+    def initialize left, right, valid, invalid
+      @left  = left
+      @right = right
+      @valid = valid
+      @invalid = invalid
+    end
+  end
+
+  class EqualNode < ConditionNode; end
+  class MoreNode  < ConditionNode; end
+  class LessNode  < ConditionNode; end
+
+  class IdentNode
+    attr_accessor :name
+    def initialize name
+      @name = name.name
+    end
+  end
+
+  class AddressNode < Node
+    attr_accessor :address
+    def initialize address
+      @address = address.name[1..-1].to_i
+    end
+  end
+
+  class NumericNode < Node
+    attr_accessor :numeric
+    def initialize numeric
+      @numeric = Integer numeric.name
+    end
+  end
+
+  class RegisterNode < Node
+    attr_accessor :register
+    def initialize register
+      @register = register.name[1..-1]
+    end
+  end
+end

data/lib/fam/syntax/lexer.rb

@@ -0,0 +1,123 @@
+require_relative 'tokens'
+
+module FAM::Syntax
+  class Lexer
+    attr_reader :tokens
+
+    def initialize io_file
+      @file_name = io_file
+      @tokens = TokenStream.new
+    end
+
+    def self.lex io_file
+      obj = self.new io_file
+      obj.lexer
+      obj
+    end
+
+    def lexer
+      puts "Lexing..." if $VERBOSE
+      @raw = File.read @file_name
+      @raw << EOF unless @raw[-1] == EOF
+
+      loc = {:line => 1, :col => 1}
+      i = 0
+      while i < @raw.size
+        unread = @raw[i..-1]
+
+        if ["\n", ";"].include? unread[0]
+          loc[:line] += 1
+          loc[:col] = 1
+          @tokens << tokenize(unread[0], :TERMINATOR, loc)
+          i += 1
+
+        elsif unread[0] == ' '
+          loc[:col] += 1
+          i += 1
+
+        elsif unread[/\A{{/, 0] || unread[/\A!/, 0]
+          comment = unread[/\A{{/, 0] || unread[/\A!/, 0]
+          comment_start = loc.clone
+          j = 0
+          if comment == '!'
+            until unread[j] == "\n" || unread[j] == EOF
+              i += 1
+              j += 1
+            end
+            j -= 1
+          else
+            until unread[j..j+1] == '}}' || unread[j] == EOF
+              i += 1
+              loc[:col] += 1
+              if unread[j] == "\n"
+                loc[:line] += 1
+                loc[:col] = 1
+              end
+              j += 1
+            end
+            j += 1
+          end
+          @tokens << tokenize(unread[0..j], :COMMENT, comment_start)
+
+        elsif label = unread[/\A[a-zA-Z_]([a-zA-Z0-9_]+)?:/, 0]
+          @tokens << tokenize(label, :LABEL, loc)
+          loc[:col] += label.size
+          i += label.size
+
+        elsif numeric = unread[/\A(\-|\+)??((?=0x|0b)([0-9A-Za-z]+)|([0-9]+((e(\-|\+)?[0-9]+)?)))/, 0]
+          @tokens << tokenize(numeric, :NUMERIC, loc)
+          loc[:col] += numeric.size
+          i += numeric.size
+
+        elsif address = unread[/\A@[0-9]+/, 0]
+          @tokens << tokenize(address, :ADDRESS, loc)
+          loc[:col] += address.size
+          i += address.size
+
+        elsif register = unread[/\A&[a-zA-Z0-9]+/, 0]
+          @tokens << tokenize(register, :REGISTER, loc)
+          loc[:col] += register.size
+          i += register.size
+
+        elsif ident = unread[/\A[A-Za-z_]([A-Za-z0-9_]+)?/, 0]
+          if Tokens::OPCODES.include? ident
+            @tokens << tokenize(ident, :OPCODE, loc)
+          else
+            @tokens << tokenize(ident, :IDENT, loc)
+          end
+
+          loc[:col] += ident.size
+          i += ident.size
+
+
+        elsif op = unread[/\A[(\+)(\-)(\:)(\|)]/, 0]
+          @tokens << tokenize(op, :OPERATOR, loc)
+          loc[:col] += op.size
+          i += op.size
+
+        else
+          i += 1
+          loc[:col] += 1
+        end
+
+      end
+
+      @tokens
+    end
+
+    private def tokenize name, type, location={:line => 'IMPLICIT TOKEN', :col => 'IMPLICIT TOKEN'}
+      TokenObject.new type, name, location
+    end
+
+    def to_s
+      result = "LEXED TOKENS:\n"
+      @tokens.tokens.each do |token|
+        widest = @tokens.tokens.map(&:type).max
+        result << "  :#{token.type}#{' ' * (widest.size - token.type.size)} :: " +
+        "[#{token.line.to_s.rjust 3}:#{token.col.to_s.ljust 3}] " +
+        "{ #{token.name.inspect.size > 10 ? (token.name[0..7] + '...').inspect : token.name.inspect} }\n"
+      end
+      result
+    end
+  end
+end

data/lib/fam/syntax/parser.rb

@@ -0,0 +1,139 @@
+require_relative 'lexer'
+
+module FAM::Syntax
+  class Parser < Lexer
+    include AST
+    attr_reader :ast
+
+    def initialize token_stream
+      @tokens = token_stream
+      @ast = SyntaxTree.new
+    end
+
+    def self.parse stream
+      obj = self.new stream
+      obj.parser
+      obj
+    end
+
+    def parser
+      @tokens.tokens.each do |t|
+        break if @tokens.current.nil?
+        puts "Parsing: (#{@tokens.current.to_s.brown})" if $VERBOSE
+        node = parse_token @tokens.current
+        puts "Parsed to: (#{node.nil? ? 'NOT PARSED'.red : node.to_s.gray})" if $VERBOSE
+        @ast << node unless node.nil?
+        @tokens.next
+        puts if $VERBOSE
+      end
+    end
+
+    def parse_token t
+      case t.type
+      when :LABEL
+        return LabelNode.new @tokens.current
+      when :OPCODE
+        case t.name
+        when 'HALT'
+          exit_status = NumericNode.new tokenize('0000', :NUMERIC)
+          exit_status = parse_token @tokens.next if @tokens.peek.type == @NUMERIC
+          return HaltNode.new exit_status
+        when 'GOTO'
+          label = parse_token @tokens.next
+          UnexpectedToken @tokens.current unless @tokens.current.type == :IDENT
+          return GotoNode.new label
+        when 'STORE'
+          value = parse_token @tokens.next
+          @tokens.next
+          ExpectedToken 'TOKEN<:OPERATOR>(`:`)', @tokens.current unless @tokens.current.name == ':'
+          to = parse_token @tokens.next
+          ExpectedToken 'ADDRESS or IDENT', @tokens.current unless @tokens.current.type == :ADDRESS || @tokens.current.type == :IDENT
+          return StoreNode.new value, to
+        when 'LOAD'
+          value = parse_token @tokens.next
+          @tokens.next
+          ExpectedToken 'TOKEN<:OPERATOR>(`:`)', @tokens.current unless @tokens.current.name == ':'
+          reg = parse_token @tokens.next
+          ExpectedToken 'REGISTER', @tokens.current unless @tokens.current.type == :REGISTER
+          return LoadNode.new value, reg
+        when 'DATA'
+          name = parse_token @tokens.next
+          UnexpectedValue name unless @tokens.current.type == :IDENT
+          if @tokens.peek.name == ':'
+            @tokens.next
+            value = parse_token @tokens.next
+          else
+            value = NumericNode.new tokenize('0000', :NUMERIC)
+          end
+          return DataNode.new name, value
+        when 'ADD', 'SUB', 'MUL', 'DIV', 'MOD'
+          value = parse_token @tokens.next
+          @tokens.next
+          ExpectedToken 'TOKEN<:OPERATOR>(`:`)', @tokens.current unless @tokens.current.name == ':'
+          to = parse_token @tokens.next
+
+          return case t.name
+          when 'ADD'
+            AddNode.new value, to
+          when 'SUB'
+            SubNode.new value, to
+          when 'MUL'
+            MulNode.new value, to
+          when 'DIV'
+            DivNode.new value, to
+          when 'MOD'
+            ModNode.new value, to
+          end
+        when 'EQUAL', 'MORE', 'LESS'
+          parse_condition
+        when 'IN'
+          reg = parse_token @tokens.next
+          ExpectedToken 'TOKEN<:REGISTER>', @tokens.current unless @tokens.current.type == :REGISTER
+          return InNode.new reg
+        when 'OUT', 'ASCII'
+          value = parse_token @tokens.next
+          if t.name == 'OUT'
+            return OutNode.new value
+          else
+            return AsciiNode.new value
+          end
+        else
+          abort "Unknown/unparsable OPCODE: `#{t.name}` at [#{t.line}:#{t.col}]!".red.bold
+        end
+      when :ADDRESS
+        return AddressNode.new @tokens.current
+      when :NUMERIC
+        return NumericNode.new @tokens.current
+      when :REGISTER
+        return RegisterNode.new @tokens.current
+      when :IDENT
+        return IdentNode.new @tokens.current
+      else
+        return nil
+      end
+    end
+
+    private def parse_condition
+      condition_type = @tokens.current.name
+      left  = parse_token @tokens.next
+      @tokens.next
+      ExpectedToken 'TOKEN<:OPERATOR>(`:`)', @tokens.current unless @tokens.current.name == ':'
+      right = parse_token @tokens.next
+
+      @tokens.next until @tokens.current.name == '|'
+      valid = parse_token @tokens.next
+      @tokens.next until @tokens.current.name == '|'
+      invalid = parse_token @tokens.next
+
+      params = [left, right, valid, invalid]
+      case condition_type
+      when 'EQUAL'
+        EqualNode.new(*params)
+      when 'MORE'
+        MoreNode.new(*params)
+      when 'LESS'
+        LessNode.new(*params)
+      end
+    end
+  end
+end

data/lib/fam/syntax/tokens.rb

@@ -0,0 +1,106 @@
+EOF = "\0"
+
+module FAM::Syntax
+  class TokenStream
+    attr_accessor :tokens
+    attr_accessor :index
+
+    def initialize
+      @tokens = []
+      @index = 0
+    end
+
+    def <<(token)
+      @tokens << token
+    end
+
+    def [](i)
+      @tokens[i]
+    end
+
+    def current
+      @tokens[@index]
+    end
+
+    def next
+      @index += 1
+      @tokens[@index]
+    end
+
+    def back
+      @index -= 1
+      @tokens[@index]
+    end
+
+    def peek i=1
+      @tokens[i + @index]
+    end
+
+    def previous i=1
+      @tokens[@index - i]
+    end
+
+    def to_s
+      @tokens.to_s
+    end
+  end
+
+  class TokenObject
+    attr_reader :type, :name, :line, :col
+
+    def initialize type, name, location
+      @type = type
+      @name = name
+      @line = location[:line]
+      @col  = location[:col]
+    end
+
+    def to_s
+      value = @name == "\n" ? '\n' : @name
+      "TOKEN<:#{@type}>(`#{value}`)"
+    end
+
+    alias :pretty_inspect :to_s
+  end
+
+  module Tokens
+    TYPES = [
+      :OPCODE,
+      :OPERAND,
+      :NUMERTIC,
+      :REGISTER,
+      :ADDRESS,
+      :LABEL,
+      :IDENT
+    ].map(&:to_s)
+
+    OPERATORS = [
+      :'+',
+      :'-',
+      :'|',
+      :':'
+    ].map(&:to_s)
+
+    OPCODES = [
+      :HALT,
+      :ALIAS,
+      :DATA,
+      :STORE,
+      :LOAD,
+      :GOTO,
+      :DATA,
+      :EQUAL,
+      :MORE,
+      :LESS,
+      :ADD,
+      :SUB,
+      :MUL,
+      :DIV,
+      :MOD,
+      :SLEEP,
+      :IN,
+      :OUT,
+      :ASCII
+    ].map(&:to_s)
+  end
+end

metadata

@@ -0,0 +1,56 @@
+--- !ruby/object:Gem::Specification
+name: fam
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Demonstrandum
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2018-03-13 00:00:00.000000000 Z
+dependencies: []
+description: A very watered down language ment to look like an assembly language.
+email: knutsen@jetspace.co
+executables:
+- fam
+extensions: []
+extra_rdoc_files: []
+files:
+- DOC.md
+- LICENSE
+- README.md
+- bin/fam
+- lib/fam.rb
+- lib/fam/error.rb
+- lib/fam/machine/cpu.rb
+- lib/fam/machine/memory.rb
+- lib/fam/syntax/ast.rb
+- lib/fam/syntax/lexer.rb
+- lib/fam/syntax/parser.rb
+- lib/fam/syntax/tokens.rb
+homepage: https://github.com/Demonstrandum/FAM
+licenses:
+- GPL-3.0
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.0.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.7.4
+signing_key: 
+specification_version: 4
+summary: Fake Assembly(ish) Machine
+test_files: []