pycplus 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: dec5bac15d4c28625dd8140e84ce9a33792b8ae7eca11615ef535c356482ddab
+  data.tar.gz: 5f2ea920f42d8215211c584b9b173a3f5e5243d939fca2d70e3381116ca427d1
+SHA512:
+  metadata.gz: 53428ab27dfd59f9c5dd9e9654bef5edbeda3bd3832943b351d459e073f309f048a60ba7a0a473d8ead2af2780818a09951e58b5e27f7626090744a05e86132c
+  data.tar.gz: '07692f12111a97f02724ae0fc3ec5c3ba535fc97306e29eaf2021a3ed0bc070a76d4180ebbce2785928324b03412bb1d521a6c3e403a86290331735ed5f7aa2f'

data/README.md

@@ -0,0 +1,93 @@
+# TDP019
+
+
+
+## Getting started
+
+To make it easy for you to get started with GitLab, here's a list of recommended next steps.
+
+Already a pro? Just edit this README.md and make it your own. Want to make it easy? [Use the template at the bottom](#editing-this-readme)!
+
+## Add your files
+
+- [ ] [Create](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#create-a-file) or [upload](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#upload-a-file) files
+- [ ] [Add files using the command line](https://docs.gitlab.com/ee/gitlab-basics/add-file.html#add-a-file-using-the-command-line) or push an existing Git repository with the following command:
+
+```
+cd existing_repo
+git remote add origin https://gitlab.liu.se/andjo858-ip/tdp019.git
+git branch -M main
+git push -uf origin main
+```
+
+## Integrate with your tools
+
+- [ ] [Set up project integrations](https://gitlab.liu.se/andjo858-ip/tdp019/-/settings/integrations)
+
+## Collaborate with your team
+
+- [ ] [Invite team members and collaborators](https://docs.gitlab.com/ee/user/project/members/)
+- [ ] [Create a new merge request](https://docs.gitlab.com/ee/user/project/merge_requests/creating_merge_requests.html)
+- [ ] [Automatically close issues from merge requests](https://docs.gitlab.com/ee/user/project/issues/managing_issues.html#closing-issues-automatically)
+- [ ] [Enable merge request approvals](https://docs.gitlab.com/ee/user/project/merge_requests/approvals/)
+- [ ] [Set auto-merge](https://docs.gitlab.com/ee/user/project/merge_requests/merge_when_pipeline_succeeds.html)
+
+## Test and Deploy
+
+Use the built-in continuous integration in GitLab.
+
+- [ ] [Get started with GitLab CI/CD](https://docs.gitlab.com/ee/ci/quick_start/index.html)
+- [ ] [Analyze your code for known vulnerabilities with Static Application Security Testing (SAST)](https://docs.gitlab.com/ee/user/application_security/sast/)
+- [ ] [Deploy to Kubernetes, Amazon EC2, or Amazon ECS using Auto Deploy](https://docs.gitlab.com/ee/topics/autodevops/requirements.html)
+- [ ] [Use pull-based deployments for improved Kubernetes management](https://docs.gitlab.com/ee/user/clusters/agent/)
+- [ ] [Set up protected environments](https://docs.gitlab.com/ee/ci/environments/protected_environments.html)
+
+***
+
+# Editing this README
+
+When you're ready to make this README your own, just edit this file and use the handy template below (or feel free to structure it however you want - this is just a starting point!). Thanks to [makeareadme.com](https://www.makeareadme.com/) for this template.
+
+## Suggestions for a good README
+
+Every project is different, so consider which of these sections apply to yours. The sections used in the template are suggestions for most open source projects. Also keep in mind that while a README can be too long and detailed, too long is better than too short. If you think your README is too long, consider utilizing another form of documentation rather than cutting out information.
+
+## Name
+Choose a self-explaining name for your project.
+
+## Description
+Let people know what your project can do specifically. Provide context and add a link to any reference visitors might be unfamiliar with. A list of Features or a Background subsection can also be added here. If there are alternatives to your project, this is a good place to list differentiating factors.
+
+## Badges
+On some READMEs, you may see small images that convey metadata, such as whether or not all the tests are passing for the project. You can use Shields to add some to your README. Many services also have instructions for adding a badge.
+
+## Visuals
+Depending on what you are making, it can be a good idea to include screenshots or even a video (you'll frequently see GIFs rather than actual videos). Tools like ttygif can help, but check out Asciinema for a more sophisticated method.
+
+## Installation
+Within a particular ecosystem, there may be a common way of installing things, such as using Yarn, NuGet, or Homebrew. However, consider the possibility that whoever is reading your README is a novice and would like more guidance. Listing specific steps helps remove ambiguity and gets people to using your project as quickly as possible. If it only runs in a specific context like a particular programming language version or operating system or has dependencies that have to be installed manually, also add a Requirements subsection.
+
+## Usage
+Use examples liberally, and show the expected output if you can. It's helpful to have inline the smallest example of usage that you can demonstrate, while providing links to more sophisticated examples if they are too long to reasonably include in the README.
+
+## Support
+Tell people where they can go to for help. It can be any combination of an issue tracker, a chat room, an email address, etc.
+
+## Roadmap
+If you have ideas for releases in the future, it is a good idea to list them in the README.
+
+## Contributing
+State if you are open to contributions and what your requirements are for accepting them.
+
+For people who want to make changes to your project, it's helpful to have some documentation on how to get started. Perhaps there is a script that they should run or some environment variables that they need to set. Make these steps explicit. These instructions could also be useful to your future self.
+
+You can also document commands to lint the code or run tests. These steps help to ensure high code quality and reduce the likelihood that the changes inadvertently break something. Having instructions for running tests is especially helpful if it requires external setup, such as starting a Selenium server for testing in a browser.
+
+## Authors and acknowledgment
+Show your appreciation to those who have contributed to the project.
+
+## License
+For open source projects, say how it is licensed.
+
+## Project status
+If you have run out of energy or time for your project, put a note at the top of the README saying that development has slowed down or stopped completely. Someone may choose to fork your project or volunteer to step in as a maintainer or owner, allowing your project to keep going. You can also make an explicit request for maintainers.

data/bin/pycplus

@@ -0,0 +1,26 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require_relative '../lib/lang.rb'
+
+
+if ARGV.empty?
+    puts "No arguments provided."
+else
+    arg = ARGV[0]
+
+    @lang_parser = MyLang.new
+
+    if File.file?(arg)
+        extension = File.extname(arg)
+
+        if extension == ".pcp"
+            @lang_parser.log(false)
+            @lang_parser.parse_file(arg)
+        else
+            puts "File is not a .pcp file, make sure to use the correct extension."
+        end
+    else
+        puts "Unable to find file #{arg}"
+    end
+end

data/lib/STL.rb

@@ -0,0 +1,12 @@
+def print(x)
+  pp x
+end
+
+module ArrayFunctions
+  def self.pop()
+    pop
+  end
+
+  def self.push()
+  end
+end

data/lib/lang.rb

@@ -0,0 +1,265 @@
+#!/usr/bin/env ruby
+
+require_relative 'rdparse.rb'
+require_relative 'nodes.rb'
+
+class MyLang
+        
+  def initialize
+
+    @lang_parser = Parser.new("lang parser") do
+      token(/\n/)
+      # token(/\\/)
+      # token(/"/) {|m| m}
+      token(/"[^"]"/) {|m| m.chars}
+      token(/\s+/)
+      token(/if/) {|m| m}
+      token(/>=/) {|m| m}
+      token(/<=/) {|m| m}
+      token(/==/) {|m| m}
+      token(/!=/) {|m| m}
+      token(/\+=/) {|m| m}
+      token(/\-=/) {|m| m}
+      token(/&&/) {|m| m}
+      token(/\|\|/) {|m| m}
+      token(/true/) {|m| m}
+      token(/false/) {|m| m}
+      token(/return/) {|m| m}
+      token(/def/) {|m| m}
+      token(/while/) {|m| m}
+      token(/\d+\.\d+/) {|m| m.to_f}
+      token(/\d+/) {|m| m.to_i}
+      token(/\w+/) {|m| m}
+      token(/./) {|m| m}
+      
+      start :program do
+        match(:statements) {|m| ProgramNode.new(m)}
+      end
+
+      rule :statements do
+        match(:statements, :statement) {|a,b| a << b}
+        match(:statement) {|a| [a]}
+      end
+
+      rule :statement do
+        match(:assignment, ';')
+        match(:function_def)
+        match(:function_call, ';')
+        match(:return, ';')
+        match(:if_statement)
+        match(:while_statement)
+      end
+
+      rule :assignment do
+        match(:identifier, :assignment_OP, :container) {|a, b, c| AssignmentNode.new(a,b,c)}
+        match(:identifier, :assignment_OP, :logical_expr) {|a, b, c| AssignmentNode.new(a,b,c)}
+        match(:identifier, :assignment_OP, :function_call) {|a, b, c| AssignmentNode.new(a,b,c)}
+      end
+
+      rule :assignment_OP do
+        match('=') {|a| a}
+        match('+=') {|a| a}
+        match('-=') {|a| a}
+      end
+
+      rule :function_def do
+        match('def', :identifier, '(', :parameters , ')', :block) {|_, a, _, b, _, c| FunctiondefNode.new(a,c,b)}
+        match('def', :identifier, '(', ')', :block) {|_, a, _, _, b| FunctiondefNode.new(a,b)}
+      end
+
+      rule :parameters do
+        match(:parameters,',' ,:parameter) {|a ,_ , b| a << b}
+        match(:parameter) {|a| [a]}
+      end
+
+      rule :parameter do
+        match(:identifier)
+      end
+
+      rule :block do
+        match('{', :statements, '}') {|_,a,_| BlockNode.new(a)}
+        match('{', '}') {|_,_| BlockNode.new()}
+      end
+
+      rule :function_call do
+        match(:identifier,'(', :arguments, ')') {|a, _, b, _| FunctioncallNode.new(a,b)}
+        match(:identifier,'(', ')') {|a, _, _| FunctioncallNode.new(a)}
+        # match(:identifier, '.', :identifier,'(', :arguments, ')') {|a, _, b, _| FunctioncallNode.new(a,b)}
+        # match(:identifier, '.', :identifier,'(',')')
+      end
+
+      rule :arguments do
+        match(:arguments, ',', :argument) {|a ,_ , b| a << b}
+        match(:argument) {|a| [a]}
+      end
+
+      rule :argument do
+        match(:logical_expr)
+        match(:function_call)
+      end
+
+      rule :return do
+        match('return', :logical_expr) {|_, a| ReturnNode.new(a)}
+        match('return', :function_call) {|_, a| ReturnNode.new(a)}
+      end
+
+      rule :while_statement do
+        match('while', '(', :logical_expr, ')', :block) {|_,_,a,_,b| WhileNode.new(a,b)}
+      end
+
+      rule :if_statement do
+        match('if', '(', :logical_expr, ')', :block) {|_,_,a,_,b| IfNode.new(a,b)}
+      end
+
+      rule :logical_expr do
+        match(:logical_expr, :logical_OP, :comparsion_expr) {|a,b,c| LogicalNode.new(a,b,c)}
+        match(:comparsion_expr)
+      end
+
+      rule :logical_OP do
+        match('&&') {|a| a}
+        match('||') {|a| a}
+      end
+
+      rule :comparsion_expr do
+        match(:comparsion_expr, :comparsion_OP, :addition_expr) {|a,b,c| ComparisonNode.new(a,b,c)}
+        match(:addition_expr)
+      end
+
+      rule :comparsion_OP do
+        match('<') {|a| a}
+        match('>') {|a| a}
+        match('<=') {|a| a}
+        match('>=') {|a| a}
+        match('==') {|a| a}
+        match('!=') {|a| a}
+      end
+
+      rule :addition_expr do
+        match(:addition_expr, :addition_OP, :multiplication_expr) {|a, b, c| ArithmeticNode.new(a,b,c)}
+        match(:multiplication_expr)
+      end
+
+      rule :addition_OP do
+        match('+') {|a| a}
+        match('-') {|a| a}
+      end
+
+      rule :multiplication_expr do
+        match(:multiplication_expr, :multiplication_OP, :power_expr) {|a, b, c| ArithmeticNode.new(a,b,c)}
+        match(:power_expr)
+      end
+
+      rule :multiplication_OP do
+        match('%') {|a| a}
+        match('*') {|a| a}
+        match('/') {|a| a}
+      end
+
+      rule :power_expr do
+        match(:unary_expr, :power_OP, :power_expr) {|a, b, c|  ArithmeticNode.new(a,b,c)}
+        match(:unary_expr)
+      end
+
+      rule :power_OP do
+        match('^') {|_| '**'}
+      end
+
+      rule :unary_expr do
+        match(:unary_OP, :unary_expr) {|a, b| UnaryNode.new(a,b)}
+        match(:binary_operand)
+      end
+
+      rule :unary_OP do
+        match('!') {|a| a}
+        match('-') {|a| a}
+      end
+
+      rule :binary_operand do
+        match(:bool)
+        match(:digit)
+        match(:function_call)
+        match(:identifier)
+        match('(', :logical_expr, ')') {|_, a, _| a}
+      end
+
+      rule :container do
+        match(:string)
+        match(:array)
+      end
+
+      rule :array do
+        match('[', :elements , ']') {|_, a, _| ArrayNode.new(a)}
+        match('[', ']') {|_,_| ArrayNode.new()}
+      end
+
+      rule :elements do
+        match(:elements,  ',', :element) {|a ,_ , b| a << b}
+        match(:element) {|a| [a]}
+      end
+
+      rule :element do
+        match(:logical_expr)
+        match(:container)
+      end
+
+      rule :string do
+        match('"', :chars, '"') {|_, a, _| StringNode.new(a)}
+        match('"', '"') {|_, _| StringNode.new()}
+      end
+
+      rule :chars do
+        match(:chars, :char) {|a , b| a << b}
+        match(:char) {|a| [a]}
+      end
+
+      rule :atom do
+        match(:bool)
+        match(:digit)
+        match(:char)
+        match(:identifier)
+      end
+
+      rule :char do
+        match(/./) {|a| CharNode.new(a)}
+      end
+
+      rule :bool do
+        match('true') {|_| BoolNode.new(true)}
+        match('false') {|_| BoolNode.new(false)}
+      end
+
+      rule :digit do
+        match(Float) {|a| DigitNode.new(a)}
+        match(Integer) {|a| DigitNode.new(a)}
+      end
+
+      rule :identifier do
+        match(/_?[a-zA-Z*]\w*/) {|a| IdentifierNode.new(a.to_sym)}
+      end
+    end
+  end
+
+  def parse_file(filename)
+    file = File.open(filename)
+    file_data = file.read
+    result = @lang_parser.parse(file_data)
+    return result.evaluate
+  end
+
+  def parse_string(str, display_output = false)
+    output = @lang_parser.parse(str)
+    if display_output
+      puts "=> #{output}"
+    end
+    return output.evaluate
+  end
+
+  def log(state = true)
+    if state
+      @lang_parser.logger.level = Logger::DEBUG
+    else
+      @lang_parser.logger.level = Logger::WARN
+    end
+  end
+end

data/lib/nodes.rb

@@ -0,0 +1,313 @@
+#!/usr/bin/env ruby
+
+require_relative 'STL.rb'
+
+class Scope
+  attr_reader :variables, :functions
+  def initialize(parent_scope = nil)
+    @variables = {}
+    @functions = {}
+    @parent_scope = parent_scope
+  end
+
+  def set_variable(name, op, expression)
+    case op
+    when '='
+      @variables[name] = expression
+    when '+='
+      @variables[name] += expression
+    when '-='
+      @variables[name] -= expression
+    end
+
+    return unless @parent_scope
+    
+    variable_scope = @parent_scope.get_scope(name, :variables)
+    
+    if variable_scope      
+      variable_scope.set_variable(name, op, expression)
+    end
+  end
+
+  def get_identifier(name, id_type)
+    scope = get_scope(name, id_type)
+    if scope
+      return scope.instance_variable_get("@#{id_type}")[name]
+    else
+      raise "[#{id_type}] #{name} not found."
+    end
+  end
+
+  def get_scope(name, id_type)
+    if instance_variable_get("@#{id_type}").has_key?(name)
+      return self
+    elsif @parent_scope
+      return @parent_scope.get_scope(name, id_type)
+    end
+  end
+
+  def set_function(name, block, parameters)
+    @functions[name] = {:parameters => parameters, :block => block}
+    if @parent_scope
+      function_scope = @parent_scope.get_scope(name, :functions)
+    end
+    if function_scope
+      function_scope.set_function(name, block, parameters)
+    end
+  end
+  
+  # def initialize_STL
+  #   return unless defined?(STL)
+  #   # STL.methods(false).each do |name|
+  #   #   method_object = STL.method(name)
+  #   #   @functions[name] = {:parameters => method_object.parameters.flatten[1..-1], :block => method_object}
+  #   # end
+  #   STL.singleton_methods(false).each do |name|
+  #     method_object = STL.method(name)
+  #     parameters = method_object.parameters.map { |type, name| name }.compact
+  #     @functions[name] = { parameters: parameters, block: method_object }
+  #   end
+
+  #   STL.instance_methods(false).each do |name|
+  #     method_object = STL.instance_method(name)
+  #     parameters = method_object.parameters.map { |type, name| name }.compact
+  #     @functions[name] = { parameters: parameters, block: method_object }
+  #   end
+  # end
+end
+
+
+class BlockNode
+  def initialize(statements = nil)
+    @block = statements
+  end
+
+  def evaluate(scope)
+    return unless @block
+    @block.each do |statement|
+      result = statement.evaluate(scope)
+      return result if result.is_a?(ReturnValue)
+    end
+  end
+end
+
+class FunctiondefNode
+  def initialize(identifier, block, parameters = [])
+    @identifier = identifier.value
+    @parameters = parameters
+    @block = block
+  end
+
+  def evaluate(scope)
+    params = @parameters.map {|parameter| parameter.value}
+    scope.set_function(@identifier, @block, params)
+  end
+end
+
+class FunctioncallNode
+  def initialize(identifier, arguments = [])
+    @identifier = identifier.value
+    @arguments = arguments
+  end
+
+  def validate_arguments(parameters)
+    if @arguments.size != parameters.size
+      raise "Wrong number of arguments (given: #{@arguments.size} expected: #{parameters.size})."
+    end
+  end
+
+  def evaluate_method(method, scope)
+    args = @arguments.map {|arg| arg.evaluate(scope)}
+    method.call(*args)
+  end
+
+  def evaluate_block(parameters, block, scope)
+    new_scope = Scope.new(scope)
+
+    parameters.zip(@arguments).each do |parameter, argument|
+      new_scope.set_variable(parameter, '=', argument.evaluate(scope))
+    end
+
+    result = block.evaluate(new_scope)
+    return result.value if result.is_a?(ReturnValue)
+  end
+
+  def evaluate(scope)
+    function_scope = scope.get_scope(@identifier, :functions)
+    if !function_scope
+      if self.respond_to?(@identifier, true)
+        method_object = method(@identifier)
+        parameters = method_object.parameters.map {|type, name| name}.compact
+        validate_arguments(parameters)
+        evaluate_method(method_object, scope)
+      else
+        raise "Function #{@identifier} not found."
+      end
+    else
+      function = function_scope.get_identifier(@identifier, :functions)
+      parameters = function[:parameters]
+      block = function[:block]
+      validate_arguments(parameters)
+      evaluate_block(parameters, block, scope)
+    end
+  end
+end
+
+class ProgramNode
+  def initialize(statements)
+    @statements = statements
+  end
+
+  def evaluate
+    global_scope = Scope.new
+    # global_scope.initialize_STL
+    
+    @statements.each do |statement|
+      result = statement.evaluate(global_scope)
+      return result.value if statement.is_a?(ReturnNode)
+    end
+    return
+  end
+end
+
+class ReturnValue
+  attr_accessor :value
+  def initialize(value)
+    @value = value
+  end
+end
+
+class ReturnNode
+  def initialize(expression)
+    @expression = expression
+  end
+
+  def evaluate(scope)
+    return ReturnValue.new(@expression.evaluate(scope))
+  end
+end
+
+
+class BinaryexpressionNode
+  def initialize(lhs, op, rhs)
+    @lhs = lhs
+    @op = op
+    @rhs = rhs
+  end
+
+  def evaluate(scope)
+    return @lhs.evaluate(scope).send(@op, @rhs.evaluate(scope))
+  end
+end
+
+class LogicalNode < BinaryexpressionNode
+  def evaluate(scope)
+    return eval("#{@lhs.evaluate(scope)}#{@op}#{@rhs.evaluate(scope)}") # Not possible to use send-method since ruby TrueClass (Ruby bools) has no method for && or ||.
+  end
+end
+
+class ComparisonNode < BinaryexpressionNode
+end
+
+class ArithmeticNode < BinaryexpressionNode
+end
+
+
+class UnaryNode
+  def initialize(op, operand)
+    @op = op
+    @operand = operand
+  end
+  def evaluate(scope)
+    return eval("#{@op}#{@operand.evaluate(scope)}") # Not possible to use send-method.
+  end
+end
+
+class AssignmentNode
+  def initialize(identifier, op, expression)
+    @identifier = identifier.value
+    @op = op
+    @expression = expression
+  end
+
+  def evaluate(scope)
+    scope.set_variable(@identifier, @op, @expression.evaluate(scope))
+  end
+end
+
+
+class ControlflowNode
+  def initialize(expression, block)
+    @expression = expression
+    @block = block
+  end
+end
+
+class IfNode < ControlflowNode
+  def evaluate(scope)
+    if @expression.evaluate(scope)
+      @block.evaluate(scope)
+    end
+  end
+end
+
+class WhileNode < ControlflowNode
+  def evaluate(scope)
+    while @expression.evaluate(scope)
+      result = @block.evaluate(scope)
+    end
+  end
+end
+
+
+# Unsure about implementation, will check with project assistant
+class ArrayNode
+  def initialize(elements = [])
+    @elements = elements
+    @data_container = {}
+  end
+
+  def evaluate(scope)
+    @elements.each_with_index do |element, index|
+      @data_container[index] = element.evaluate(scope) 
+    end
+  end
+end
+
+
+# Not implemented yet
+class StringNode
+  def initialize(chars = [])
+    @chars = chars
+  end
+
+  def evaluate(scope)
+  end
+end
+
+
+class PrimitiveNode
+  attr_reader :value
+  def initialize(value)
+    @value = value
+  end
+
+  def evaluate(scope)
+    return @value
+  end
+end
+
+class IdentifierNode < PrimitiveNode
+  def evaluate(scope)
+    return scope.get_identifier(@value, :variables)
+  end
+end
+
+class CharNode < PrimitiveNode
+end
+
+class DigitNode < PrimitiveNode
+end
+
+class BoolNode < PrimitiveNode
+end

data/lib/rdparse.rb

@@ -0,0 +1,231 @@
+#!/usr/bin/env ruby
+
+# This file is called rdparse.rb because it implements a Recursive
+# Descent Parser. Read more about the theory on e.g.
+# http://en.wikipedia.org/wiki/Recursive_descent_parser
+
+# 2010-02-11 New version of this file for the 2010 instance of TDP007
+#   which handles false return values during parsing, and has an easy way
+#   of turning on and off debug messages.
+# 2014-02-16 New version that handles { false } blocks and :empty tokens.
+
+require 'logger'
+
+class Rule
+
+  # A rule is created through the rule method of the Parser class, like this:
+  #   rule :term do
+  #     match(:term, '*', :dice) {|a, _, b| a * b }
+  #     match(:term, '/', :dice) {|a, _, b| a / b }
+  #     match(:dice)
+  #   end
+  
+  Match = Struct.new :pattern, :block
+  
+  def initialize(name, parser)
+    @logger = parser.logger
+    # The name of the expressions this rule matches
+    @name = name
+    # We need the parser to recursively parse sub-expressions occurring 
+    # within the pattern of the match objects associated with this rule
+    @parser = parser
+    @matches = []
+    # Left-recursive matches
+    @lrmatches = []
+  end
+  
+  # Add a matching expression to this rule, as in this example:
+  #   match(:term, '*', :dice) {|a, _, b| a * b }
+  # The arguments to 'match' describe the constituents of this expression.
+  def match(*pattern, &block)
+    match = Match.new(pattern, block)
+    # If the pattern is left-recursive, then add it to the left-recursive set
+    if pattern[0] == @name
+      pattern.shift
+      @lrmatches << match
+    else
+      @matches << match
+    end
+  end
+  
+  def parse
+    # Try non-left-recursive matches first, to avoid infinite recursion
+    match_result = try_matches(@matches)
+    return nil if match_result.nil?
+    loop do
+      result = try_matches(@lrmatches, match_result)
+      return match_result if result.nil?
+      match_result = result
+    end
+  end
+
+  private
+  
+  # Try out all matching patterns of this rule
+  def try_matches(matches, pre_result = nil)
+    match_result = nil
+    # Begin at the current position in the input string of the parser
+    start = @parser.pos
+    matches.each do |match|
+      # pre_result is a previously available result from evaluating expressions
+      result = pre_result.nil? ? [] : [pre_result]
+
+      # We iterate through the parts of the pattern, which may be e.g.
+      #   [:expr,'*',:term]
+      match.pattern.each_with_index do |token,index|
+        
+        # If this "token" is a compound term, add the result of
+        # parsing it to the "result" array
+        if @parser.rules[token]
+          result << @parser.rules[token].parse
+          if result.last.nil?
+            result = nil
+            break
+          end
+          @logger.debug("Matched '#{@name} = #{match.pattern[index..-1].inspect}'")
+        else
+          # Otherwise, we consume the token as part of applying this rule
+          nt = @parser.expect(token)
+          if nt
+            result << nt
+            if @lrmatches.include?(match.pattern) then
+              pattern = [@name]+match.pattern
+            else
+              pattern = match.pattern
+            end
+            @logger.debug("Matched token '#{nt}' as part of rule '#{@name} <= #{pattern.inspect}'")
+          else
+            result = nil
+            break
+          end
+        end # pattern.each
+      end # matches.each
+      if result
+        if match.block
+          match_result = match.block.call(*result)
+        else
+          match_result = result[0]
+        end
+        @logger.debug("'#{@parser.string[start..@parser.pos-1]}' matched '#{@name}' and generated '#{match_result.inspect}'") unless match_result.nil?
+        break
+      else
+        # If this rule did not match the current token list, move
+        # back to the scan position of the last match
+        @parser.pos = start
+      end
+    end
+    
+    return match_result
+  end
+end
+
+class Parser
+
+  attr_accessor :pos
+  attr_reader :rules, :string, :logger
+
+  class ParseError < RuntimeError
+  end
+
+  def initialize(language_name, &block)
+    @logger = Logger.new(STDOUT)
+    @lex_tokens = []
+    @rules = {}
+    @start = nil
+    @language_name = language_name
+    instance_eval(&block)
+  end
+  
+  # Tokenize the string into small pieces
+  def tokenize(string)
+    @tokens = []
+    @string = string.clone
+    until string.empty?
+      # Unless any of the valid tokens of our language are the prefix of
+      # 'string', we fail with an exception
+      raise ParseError, "unable to lex '#{string}" unless @lex_tokens.any? do |tok|
+        match = tok.pattern.match(string)
+        # The regular expression of a token has matched the beginning of 'string'
+        if match
+          @logger.debug("Token #{match[0]} consumed")
+          # Also, evaluate this expression by using the block
+          # associated with the token
+          @tokens << tok.block.call(match.to_s) if tok.block
+          # consume the match and proceed with the rest of the string
+          string = match.post_match
+          true
+        else
+          # this token pattern did not match, try the next
+          false
+        end # if
+      end # raise
+    end # until
+  end
+  
+  def parse(string)
+    # First, split the string according to the "token" instructions given.
+    # Afterwards @tokens contains all tokens that are to be parsed. 
+    tokenize(string)
+
+    # These variables are used to match if the total number of tokens
+    # are consumed by the parser
+    @pos = 0
+    @max_pos = 0
+    @expected = []
+    # Parse (and evaluate) the tokens received
+    result = @start.parse
+    # If there are unparsed extra tokens, signal error
+    if @pos != @tokens.size
+      raise ParseError, "Parse error. expected: '#{@expected.join(', ')}', found '#{@tokens[@max_pos]}'"
+    end
+    return result
+  end
+  
+  def next_token
+    @pos += 1
+    return @tokens[@pos - 1]
+  end
+
+  # Return the next token in the queue
+  def expect(tok)
+    return tok if tok == :empty
+    t = next_token
+    if @pos - 1 > @max_pos
+      @max_pos = @pos - 1
+      @expected = []
+    end
+    return t if tok === t
+    @expected << tok if @max_pos == @pos - 1 && !@expected.include?(tok)
+    return nil
+  end
+  
+  def to_s
+    "Parser for #{@language_name}"
+  end
+
+  private
+  
+  LexToken = Struct.new(:pattern, :block)
+  
+  def token(pattern, &block)
+    @lex_tokens << LexToken.new(Regexp.new('\\A' + pattern.source), block)
+  end
+  
+  def start(name, &block)
+    rule(name, &block)
+    @start = @rules[name]
+  end
+  
+  def rule(name,&block)
+    @current_rule = Rule.new(name, self)
+    @rules[name] = @current_rule
+    instance_eval &block # In practise, calls match 1..N times
+    @current_rule = nil
+  end
+  
+  def match(*pattern, &block)
+    # Basically calls memberfunction "match(*pattern, &block)
+    @current_rule.send(:match, *pattern, &block)
+  end
+
+end

data/lib/test.rb

@@ -0,0 +1,161 @@
+require_relative '../lib/lang.rb'
+require 'test/unit'
+
+class TestFaculty < Test::Unit::TestCase
+  def setup
+    @lang_parser = MyLang.new
+    @lang_parser.log(false)
+  end
+
+  # # Test for simple addition
+  # def test_addition_expr
+  #   assert_equal(1, @lang_parser.parse_string("return 0+1;"))
+  #   assert_equal(0, @lang_parser.parse_string("return -1+1;"))
+  #   assert_equal(-1, @lang_parser.parse_string("return -2+1;"))
+  # end
+
+  # # Test for simple subtraction
+  # def test_subtraction_expr
+  #   assert_equal(1, @lang_parser.parse_string("return 2-1;"))
+  #   assert_equal(0, @lang_parser.parse_string("return 1-1;"))
+  #   assert_equal(-1, @lang_parser.parse_string("return 1-2;"))
+  #   assert_equal(2, @lang_parser.parse_string("return 1--1;"))
+  # end
+
+  # # Test for simple multiplication
+  # def test_multiplication_expr
+  #   assert_equal(1, @lang_parser.parse_string("return 1*1;"))
+  #   assert_equal(0, @lang_parser.parse_string("return 0*1;"))
+  #   assert_equal(-1, @lang_parser.parse_string("return -1*1;"))
+  # end
+
+  # # Test for simple division
+  # def test_division_expr
+  #   assert_equal(1, @lang_parser.parse_string("return 1/1;"))
+  #   assert_equal(0, @lang_parser.parse_string("return 0/1;"))
+  #   assert_equal(-1, @lang_parser.parse_string("return -1/1;"))
+  # end
+
+  # # Test for simple modulo
+  # def test_modulo_expr
+  #   assert_equal(0, @lang_parser.parse_string("return 9%3;"))
+  #   assert_equal(1, @lang_parser.parse_string("return 5%2;"))
+  # end
+
+  # # Test for parentheses priority
+  # def test_parentheses_priority
+  #   assert_equal(3, @lang_parser.parse_string("return (3-2)*3;"))
+  #   assert_equal(7, @lang_parser.parse_string("return (3+4)*(6-2)/(2+2);"))
+  #   assert_equal(1, @lang_parser.parse_string("return (5-3)/(1*2);"))
+  # end
+
+  # # test for power expressions
+  # def test_power_expr
+  #   assert_equal(4, @lang_parser.parse_string("return 2^2;"))
+  #   assert_equal(8, @lang_parser.parse_string("return 2^2*2;"))
+  #   assert_equal(256, @lang_parser.parse_string("return 2^2^3;"))
+  # end
+
+  # # Test for variable names
+  # def test_variable_names
+  #   assert_equal(1, @lang_parser.parse_string("a = 1; return a;"))
+  #   assert_equal(1, @lang_parser.parse_string("_a = 1; return _a;"))
+  #   assert_equal(1, @lang_parser.parse_string("A131 = 1; return A131;"))
+    
+  #   # Forbidden variable names throws parsing error
+  #   assert_raises Parser::ParseError do
+  #     @lang_parser.parse_string("1a = 1;")
+  #   end
+  #   assert_raises Parser::ParseError do
+  #     @lang_parser.parse_string("_1 = 1;")
+  #   end
+  #   assert_raises Parser::ParseError do
+  #     @lang_parser.parse_string("1 = 1;")
+  #   end
+  #   assert_raises Parser::ParseError do
+  #     @lang_parser.parse_string("1 = 1;")
+  #   end
+  #   assert_raises Parser::ParseError do
+  #     @lang_parser.parse_string("_a? = 1;")
+  #   end
+  # end
+
+  # # Test for comparsion expressions
+  # def test_comparison_expr
+  #   assert_equal(true, @lang_parser.parse_string("return 1 < 2;"))
+  #   assert_equal(false, @lang_parser.parse_string("return 1 > 2;"))
+
+  #   assert_equal(false, @lang_parser.parse_string("return 1 >= 2;"))
+  #   assert_equal(true, @lang_parser.parse_string("return 2 >= 2;"))
+  #   assert_equal(true, @lang_parser.parse_string("return 1 <= 2;"))
+  #   assert_equal(false, @lang_parser.parse_string("return 3 <= 2;"))
+
+  #   assert_equal(false, @lang_parser.parse_string("return 1 == 2;"))
+  #   assert_equal(true, @lang_parser.parse_string("return 2 == 2;"))
+  #   assert_equal(true, @lang_parser.parse_string("return false == false;"))
+  #   assert_equal(true, @lang_parser.parse_string("a=2; return a == 2;"))
+  #   assert_equal(false, @lang_parser.parse_string("a=2; return a == 3;"))
+
+  #   assert_equal(true, @lang_parser.parse_string("return 1 != 2;"))
+  #   assert_equal(false, @lang_parser.parse_string("return 2 != 2;"))
+  # end
+
+  # # Test for bool assignment
+  # def test_assignmen_bool
+  #   assert_equal(false, @lang_parser.parse_string("a = false; return a;"))
+  #   assert_equal(true, @lang_parser.parse_string("a = true; return a;"))
+  # end
+
+  # # Test for logical expressions 
+  # def test_logical_expr
+  #   assert_equal(false, @lang_parser.parse_string("a = true && false; return a;"))
+  #   assert_equal(true, @lang_parser.parse_string("a = false || true; return a;"))
+  #   assert_equal(true, @lang_parser.parse_string("a = true && false || true; return a;"))
+  # end
+
+  # # Test for if statements
+  # def test_if_statement
+  #   assert_equal(11, @lang_parser.parse_string("a=1; if(10>1){b=10; a=a+b;} return a;"))
+  #   assert_equal(1, @lang_parser.parse_string("a=1; if(a<1){b=10; a=a+b;} return a;"))
+    
+  #   # Raises error when variable has not been defined in if-statement
+  #   assert_raises RuntimeError do
+  #     @lang_parser.parse_string("if(10<1){a=33;} return a;")
+  #   end
+  # end
+
+  # # Test for define function and call
+  # def test_function_def_and_call
+  #   assert_equal(4, @lang_parser.parse_string("def test(z,x){a = z+x; return a+1;} b=test(1,2); return b;"))
+  #   assert_equal(11, @lang_parser.parse_string("def test(){a = 10; return a+1;} return test();"))
+  #   assert_equal(true, @lang_parser.parse_string("def test(x){return x && true;} return test(true);"))
+  #   assert_equal(100, @lang_parser.parse_string("a=1; b=99; def test(x){c=x+b; return c;} return test(a);"))
+  #   assert_equal(100, @lang_parser.parse_string("a=1; b=99; def test(x){a=x+b;} test(a); return a;"))
+
+  #   # Raises error when functioncall with wrong number of arguments
+  #   assert_raises RuntimeError do
+  #     @lang_parser.parse_string("def test(){a = 10; return a+1;} return test(1);")
+  #   end
+
+  #   # Raises error when functioncall with wrong name
+  #   assert_raises RuntimeError do
+  #     @lang_parser.parse_string("def test(){a = 10; return a+1;} a(1);")
+  #   end
+  # end
+
+  # # Test for while-statement
+  # def test_while_statement
+  #   assert_equal(10, @lang_parser.parse_string("a=1; while(a<10){a=a+1;} return a;"))
+  #   assert_equal(18, @lang_parser.parse_string("a=1; while(a<10){b=a*2; a=a+1;} return b;"))
+
+  #   assert_raises RuntimeError do
+  #     assert_equal(10, @lang_parser.parse_string("a=1; while(a>10){b=a+1;} return b;"))
+  #   end  
+  # end
+
+  # Test for recursion
+  def test_recursion
+    # assert_equal(720, @lang_parser.parse_string("def factorial(n){if(n==0 || n==1){return 1;} return n*factorial(n-1);} print(factorial(6);)"))
+    assert_equal(720, @lang_parser.parse_string("x=1; def hahatest(){ print(x); return x;} x=99; def tt(){x=22;}  print(hahatest()); tt(); return x;"))
+  end
+end

metadata

@@ -0,0 +1,71 @@
+--- !ruby/object:Gem::Specification
+name: pycplus
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Johannes
+- Andreas
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2024-05-01 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: test-unit
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.6'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.6.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.6'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.6.0
+description: This Ruby Gem provides a framework for creating and utilizing a domain-specific
+  language (DSL) developed as part of a school project at LiU (Linköping University).
+email: test@test.com
+executables:
+- pycplus
+extensions: []
+extra_rdoc_files: []
+files:
+- README.md
+- bin/pycplus
+- lib/STL.rb
+- lib/lang.rb
+- lib/nodes.rb
+- lib/rdparse.rb
+- lib/test.rb
+homepage: https://rubygems.org/gems/mytestdsl
+licenses: []
+metadata: {}
+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.5
+signing_key: 
+specification_version: 4
+summary: A Ruby Gem for creating and using a domain-specific language (DSL)
+test_files: []