SEATC 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e8525a42e73d7a9191be39f46c9af7c64f8e3460
-  data.tar.gz: 541d53ecbf327f5664b628b6ca48a5a29674486d
+  metadata.gz: f9df31347e1f612c2d056fe05ec5cdac6c77e0c2
+  data.tar.gz: d778061e15ef7df2dc031848cba31e8e8ca26826
 SHA512:
-  metadata.gz: 5a8050ecdd4cfb8eee5ea46b802ffa0fb5320363d5d01571aca471251ad426a38106666715d2edd4fdafc43b1a52f0286d3cb9c05da779fa086d58225ba02702
-  data.tar.gz: 3f450b998e9e3111ce26083bc7f9dc4ceec353f3846c2295c3f9ef7b8c077946e53cd469e227512023396e702f282660160c7f6b7b48d065ca552439a68eb95a
+  metadata.gz: 292b192c4599f64afe0182c8315d63e5febfc9cd37a713b8752e63dfc9916c7fa673113b29d6f5b0f6d098817dd4758f3e7774645d9db83197790460e6bf8b14
+  data.tar.gz: 551e165f54254e76219fc3a75cc9a0a50f2490f4d907caf6457a6b5659f23d7b02742dc2337184a0e6c6a40dc3a3192b466ce5cf33be4c40253848134fc22d1f

data/bin/Turing Analyzer

@@ -0,0 +1,4 @@
+require 'Turing Analyzer'
+
+turing = TuringAnalyzer.new
+valid = turing.analyze "../samples/Turing Machine.jff", "B0110B"

data/lib/Grammar Reader.rb

@@ -1,8 +1,7 @@
-SYNTAX_ERROR = 1
-PRODUCTION_ERROR = 2
-
 class GrammarReader
-  attr_accessor :error
+	SYNTAX_ERROR = 1
+	PRODUCTION_ERROR = 2  
+	attr_accessor :error
 
   def initialize()
     @error = 0
@@ -34,7 +33,7 @@ class GrammarReader
   #returns the Hash containing the productions
   def createProductions(lines)
     productions = Hash.new
-    if !lines[0].include? "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?><!--Created with JFLAP 6.4.--><structure>&#13;"
+    if !lines[0].include? "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?><!--Created with JFLAP"
       @error = SYNTAX_ERROR
       return productions
     end

data/lib/Regular Expression.rb

@@ -16,6 +16,11 @@ class RegularExpression
     end
     regex = lines[3]
     regex.slice! "\t<expression>"
+    if regex.match "&#13;"
+      regex.reverse!
+      regex.slice! "&#13;".reverse
+      regex.reverse!
+    end
     regex.reverse!
     regex.slice! "</expression>".reverse
     regex.reverse!

data/lib/Turing Analyzer.rb

@@ -0,0 +1,254 @@
+require 'thread'
+load 'Turing Reader.rb'
+class TuringState
+    attr_accessor :tag, :id, :name, :initial, :final, :transitions
+    def initialize
+        @transitions = Hash.new
+    end
+end
+
+class TuringTransition
+    attr_accessor :to, :write, :move
+end
+
+class TuringAnalyzer
+    attr_accessor :reader, :lines, :states, :valid
+    @initial
+    def initialize
+        @reader = TuringReader.new
+        @states = Array.new
+        @initial = nil
+        @valid = false
+    end
+
+    def analyze file, line
+        @lines = @reader.readFile file
+        puts "Valid" if validateJFlap
+        deleteLine
+        puts "Valid" if validateTuringMachine
+        deleteLine
+        createStates
+        position = 0
+        until line[position] != "B"
+            position = position + 1
+        end
+        validate line, @initial, position
+        return @valid
+    end
+
+    def validateJFlap
+        return true if @lines[0].match "JFLAP"
+        return false
+    end
+
+    def validateTuringMachine
+        return true if @lines[0].match "turing"
+        return false
+    end
+
+    def createStates
+        return false if !lines[0].match "automaton"
+        deleteLine
+        if lines[0].match "<!--The list of states.-->"
+            deleteLine
+        else
+            return false
+        end
+        while createState 
+        end
+        if lines[0].match "<!--The list of transitions.-->"
+            deleteLine
+        else
+            return false
+        end
+        until createTransition == false
+        end
+        puts @states.to_s
+    end
+
+    def createState
+        state = TuringState.new
+        return false if !lines[0].match "block"
+        deleteTabs
+        lines[0].slice! "<block "
+        # Create id
+        state.id = 0
+        lines[0].slice! "id=\""
+        until lines[0][0] == "\""
+            state.id = state.id * 10
+            state.id = state.id + lines[0][0].to_i
+            lines[0].slice! lines[0][0]
+        end
+        lines[0].slice! "\" "
+        # Create name
+        state.name = ""
+        lines[0].slice! "name=\""
+        until lines[0][0] == "\""
+            state.name = state.name + lines[0][0]
+            lines[0].slice! lines[0][0]
+        end
+        deleteLine
+        # Tags
+        return false if !lines[0].match "tag"
+        deleteLine
+        # X position
+        deleteLine
+        # Y position
+        deleteLine
+        # Initial?
+        state.initial = false
+        if lines[0].match "initial"
+            @initial = state.id if @initial == nil
+            state.initial = true
+            deleteLine
+        end
+        # Final?
+        state.final = false
+        if lines[0].match "final"
+            state.final = true
+            deleteLine
+        end
+        # Check closing bracket
+        return false if !lines[0].match "</block>"
+        deleteLine
+        @states[state.id] = state
+        return true
+    end
+
+    def createTransition
+        from = 0
+        to = 0
+        if lines[0].match "<transition>"
+            deleteLine
+        else
+            return false
+        end
+        # From
+        deleteTabs
+        lines[0].slice! "<from>"
+        until lines[0][0] == "<"
+            from = from * 10
+            from = from + lines[0][0].to_i
+            lines[0].slice! lines[0][0]
+        end
+        deleteLine
+        # To
+        deleteTabs
+        lines[0].slice! "<to>"
+        until lines[0][0] == "<"
+            to = to * 10
+            to = to + lines[0][0].to_i
+            lines[0].slice! lines[0][0]
+        end
+        deleteLine
+        # Read
+        if lines[0].match "<read/>"
+            read = nil
+        else
+            deleteTabs
+            read = 0
+            lines[0].slice! "<read>"
+            until lines[0][0] == "<"
+                read = read * 10
+                read = read + lines[0][0].to_i
+                lines[0].slice! lines[0][0]
+            end
+        end
+        deleteLine
+        # Write
+        if lines[0].match "<write/>"
+            write = nil
+        else
+            deleteTabs
+            write = 0
+            lines[0].slice! "<write>"
+            until lines[0][0] == "<"
+                write = write * 10
+                write = write + lines[0][0].to_i
+                lines[0].slice! lines[0][0]
+            end
+        end
+        deleteLine
+        if lines[0].match "<move>R"
+            move = "R"
+        elsif lines[0].match "<move>L"
+            move = "L"
+        elsif lines[0].match "<move>S"
+            move = "S"
+        else
+            move = nil
+        end
+        if @states[from].transitions[read] == nil
+            @states[from].transitions[read] = Array.new
+        end
+        trans = TuringTransition.new
+        trans.to = to
+        trans.write = write
+        trans.move = move
+        @states[from].transitions[read].push trans
+        deleteLine
+        if lines[0].match "</transition>"
+            deleteLine
+            return true
+        end
+        return false
+    end
+
+    def deleteLine
+        size = @lines.size
+        newLines = Array.new
+        for i in 0...size-1
+            newLines[i] = @lines[i+1]
+        end
+        @lines = newLines
+    end
+
+    def deleteTabs
+        until !lines[0].match "\t"
+            lines[0].slice! "\t"
+        end
+    end
+
+    def validate line, actual, position
+        transitions = @states[actual].transitions
+        # Launch no read transition
+        read = line[position]
+        if transitions[nil] != nil
+            transitions[nil].each do |trans|
+                if read == "B"
+                    if trans.write == nil
+                        line[position] = "B"
+                    else
+                        line[position] = trans.write
+                    end
+                    newPos = position - 1 if trans.move == "L"
+                    newPos = position + 1 if trans.move == "R"
+                    newPos = position if trans.move == "S"
+                    nilThread = Thread.new { validate(line, trans.to, newPos)}
+                    nilThread.join
+                end
+            end
+        end
+        # Launch read transition / End if no transition
+        read = line[position]
+        if transitions[read] == nil
+            if @valid == false && @states[actual].final == true
+                @valid = true
+            end
+        else
+            transitions[read].each do |trans|
+                if trans.write == nil
+                    line[position] = "B"
+                else
+                    line[position] = trans.write
+                end
+                newPos = position - 1 if trans.move == "L"
+                newPos = position + 1 if trans.move == "R"
+                newPos = position if trans.move == "S"
+                thread = Thread.new { validate(line, trans.to, newPos)}
+                thread.join
+            end
+        end
+    end
+
+end

data/lib/Turing Reader.rb

@@ -0,0 +1,10 @@
+class TuringReader
+
+	def readFile(file)
+		file = File.new file, "r"
+		line = file.read
+		file.close
+		lines = line.split "\n"
+	end
+
+end

data/samples/Regular Expression.jff

@@ -1,5 +1,5 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?><!--Created with JFLAP 6.4.--><structure>
 	<type>re</type>
 	<!--The regular expression.-->
-	<expression>a*b*c+</expression>
+	<expression>a+b</expression>
 </structure>

data/samples/Turing Machine.jff

@@ -0,0 +1,70 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?><!--Created with JFLAP 6.4.--><structure>
+	<type>turing</type>
+	<automaton>
+		<!--The list of states.-->
+		<block id="0" name="q0">
+			<tag>Machine0</tag>
+			<x>60.0</x>
+			<y>177.0</y>
+			<initial/>
+		</block>
+		<block id="1" name="q1">
+			<tag>Machine1</tag>
+			<x>185.0</x>
+			<y>75.0</y>
+		</block>
+		<block id="2" name="q2">
+			<tag>Machine2</tag>
+			<x>306.0</x>
+			<y>183.0</y>
+			<final/>
+		</block>
+		<!--The list of transitions.-->
+		<transition>
+			<from>0</from>
+			<to>1</to>
+			<read/>
+			<write/>
+			<move>L</move>
+		</transition>
+		<transition>
+			<from>1</from>
+			<to>1</to>
+			<read>1</read>
+			<write>1</write>
+			<move>L</move>
+		</transition>
+		<transition>
+			<from>1</from>
+			<to>1</to>
+			<read>0</read>
+			<write>0</write>
+			<move>L</move>
+		</transition>
+		<transition>
+			<from>1</from>
+			<to>2</to>
+			<read/>
+			<write/>
+			<move>R</move>
+		</transition>
+		<transition>
+			<from>0</from>
+			<to>0</to>
+			<read>1</read>
+			<write>0</write>
+			<move>R</move>
+		</transition>
+		<transition>
+			<from>0</from>
+			<to>0</to>
+			<read>0</read>
+			<write>1</write>
+			<move>R</move>
+		</transition>
+		<!--The list of automata-->
+		<Machine0/>
+		<Machine2/>
+		<Machine1/>
+	</automaton>
+</structure>

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: SEATC
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - Salvador Guerra Delgado
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-06-14 00:00:00.000000000 Z
+date: 2018-08-22 00:00:00.000000000 Z
 dependencies: []
 description: A gem for development on SEATC, can be used for other system that requires
   automaton and grammars analysis
@@ -24,18 +24,22 @@ files:
 - bin/Pushdown Automaton
 - bin/Regular Expression
 - bin/Regular Grammar
+- bin/Turing Analyzer
 - lib/Automaton Analyzer.rb
 - lib/Grammar Analyzer.rb
 - lib/Grammar Reader.rb
 - lib/PDA.rb
 - lib/Regular Expression.rb
 - lib/Regular Grammar Analyzer.rb
+- lib/Turing Analyzer.rb
+- lib/Turing Reader.rb
 - samples/Deterministic Finite Automaton.jff
 - samples/Finite Automaton.jff
 - samples/Nondeterministic.jff
 - samples/Pushdown.jff
 - samples/Regular Expression.jff
 - samples/Regular Grammar.jff
+- samples/Turing Machine.jff
 homepage: http://rubygems.org/gems/SEATC
 licenses:
 - MIT