Add files via upload

Author: rollrat

InhaCC/InhaCC/cc/ParserGenerator.cs

@@ -151,6 +151,15 @@ private void print_hs(List<HashSet<int>> lhs, string prefix)
                         $"{prefix}({production_rules[i].production_name})={{{string.Join(",", lhs[i].ToList().Select(x => x == -1 ? "$" : production_rules[x].production_name))}}}\r\n");
         }
 
+        private void print_header(string head_text)
+        {
+            GlobalPrinter.Append("\r\n" + new string('=', 50) + "\r\n\r\n");
+            int spaces = 50 - head_text.Length;
+            int padLeft = spaces / 2 + head_text.Length;
+            GlobalPrinter.Append(head_text.PadLeft(padLeft).PadRight(50));
+            GlobalPrinter.Append("\r\n\r\n" + new string('=', 50) + "\r\n");
+        }
+
         private void print_states(int state, List<Tuple<int, int, int, HashSet<int>>> items)
         {
             var builder = new StringBuilder();
@@ -275,6 +284,7 @@ public void Generate()
                                     FOLLOW[rule.Last().index].Add(r);
 
 #if true
+            print_header("FISRT, FOLLOW SETS");
             print_hs(FIRST, "FIRST");
             print_hs(FOLLOW, "FOLLOW");
 #endif
@@ -423,6 +433,7 @@ public void GenerateLR1()
                                     FOLLOW[rule.Last().index].Add(r);
 
 #if true
+            print_header("FISRT, FOLLOW SETS");
             print_hs(FIRST, "FIRST");
             print_hs(FOLLOW, "FOLLOW");
 #endif
@@ -571,6 +582,7 @@ public void GenerateLR1()
                     if (shift_tokens.ContainsKey(tuple.Item1))
                     {
 #if true
+                        print_header("SHIFT-REDUCE CONFLICTS");
                         GlobalPrinter.Append($"Shift-Reduce Conflict! {(tuple.Item1 == -1 ? "$" : production_rules[tuple.Item1].production_name)}\r\n");
                         GlobalPrinter.Append($"States: {ms.Key} {tuple.Item2}\r\n");
                         print_states(ms.Key, states[ms.Key]);
@@ -632,6 +644,7 @@ public void GenerateLR1()
 
             number_of_states = states.Count;
 #if true
+            print_header("STATES INFO");
             foreach (var s in states)
                 print_states(s.Key, s.Value);
 #endif
@@ -689,6 +702,7 @@ public void GenerateLALR()
                                     FOLLOW[rule.Last().index].Add(r);
 
 #if true
+            print_header("FISRT, FOLLOW SETS");
             print_hs(FIRST, "FIRST");
             print_hs(FOLLOW, "FOLLOW");
 #endif
@@ -773,6 +787,7 @@ public void GenerateLALR()
             }
 
 #if true
+            print_header("UNMERGED STATES");
             foreach (var s in states)
                 print_states(s.Key, s.Value);
 #endif
@@ -806,6 +821,7 @@ public void GenerateLALR()
             }
 
 #if true
+            print_header("MERGED STATES WITH SOME SETS");
             foreach (var s in merged_states)
                 print_merged_states(s.Key, states[s.Key], s.Value.Select(x => states[x].Select(y => y.Item4.ToList()).ToList()).ToList());
 #endif
@@ -821,6 +837,7 @@ public void GenerateLALR()
             }
 
 #if true
+            print_header("MERGED STATES");
             foreach (var s in merged_states)
                 print_states(s.Key, states[s.Key]);
 #endif
@@ -866,6 +883,7 @@ public void GenerateLALR()
                     if (shift_tokens.ContainsKey(tuple.Item1))
                     {
 #if true
+                        print_header("SHIFT-REDUCE CONFLICTS");
                         GlobalPrinter.Append($"Shift-Reduce Conflict! {(tuple.Item1 == -1 ? "$" : production_rules[tuple.Item1].production_name)}\r\n");
                         GlobalPrinter.Append($"States: {ms.Key} {tuple.Item2}\r\n");
                         print_states(ms.Key, states[ms.Key]);
@@ -931,6 +949,7 @@ public void GenerateLALR()
 
         public void PrintStates()
         {
+            print_header("FINAL STATES");
             for (int i = 0; i < number_of_states; i++)
             {
                 var builder = new StringBuilder();
@@ -1042,8 +1061,8 @@ public void PrintTable()
                 builder.Append("\r\n");
             }
             builder.Append(split_line);
-
-
+            
+            print_header("PARSING TABLE");
             GlobalPrinter.Append(builder.ToString() + "\r\n");
         }
 
@@ -1307,7 +1326,8 @@ public class ParsingTreeNode
         {
             public string Produnction;
             public string Contents;
-            public string UserContents;
+            public object UserContents;
+            public int ProductionRuleIndex;
             public ParsingTreeNode Parent;
             public List<ParsingTreeNode> Childs;
 
@@ -1318,15 +1338,13 @@ public static ParsingTreeNode NewNode(string production)
             public static ParsingTreeNode NewNode(string production, string contents)
                 => new ParsingTreeNode { Parent = null, Childs = new List<ParsingTreeNode>(), Produnction = production, Contents = contents };
         }
-
-        int tree_index;
+        
         ParsingTreeNode root;
 
-        public ParsingTree(int index = 0)
+        public ParsingTree(ParsingTreeNode root)
         {
-            tree_index = index;
+            this.root = root;
         }
-
     }
 
     /// <summary>
@@ -1371,6 +1389,8 @@ public void Clear()
             treenode_stack.Clear();
         }
 
+        public ParsingTree Tree => new ParsingTree(treenode_stack.Peek());
+
         public string Stack() => string.Join(" ", new Stack<int>(state_stack));
 
         public void Insert(string token_name, string contents) => Insert(symbol_name_index[token_name], contents);
@@ -1426,6 +1446,7 @@ private void reduce(int index)
             state_stack.Push(goto_table[state_stack.Peek()][group_table[reduce_production]]);
 
             var reduction_parent = ParsingTree.ParsingTreeNode.NewNode(symbol_index_name[group_table[reduce_production]]);
+            reduction_parent.ProductionRuleIndex = reduce_production - 1;
             reduce_treenodes.ForEach(x => x.Parent = reduction_parent);
             reduction_parent.Contents = string.Join("", reduce_treenodes.Select(x => x.Contents));
             reduction_parent.Childs = reduce_treenodes;

InhaCC/InhaCC/cc/ScannerGenerator.cs

@@ -149,7 +149,7 @@ private diagram make_nfa(string pattern)
                         break;
 
                     case ')':
-                        if (opstack.Peek() != '(')
+                        if (opstack.Count == 0 || opstack.Peek() != '(')
                         {
                             build_errors.Add($"[regex] {i} no opener!");
                             return null;
@@ -896,6 +896,8 @@ public class Scanner
         bool err = false;
         int latest_pos;
         List<int> err_pos;
+        int current_line;
+        int current_column;
 
         public Scanner(int[][] transition_table, string[] accept_table)
         {
@@ -907,6 +909,8 @@ public void AllocateTarget(string literal)
         {
             target = literal;
             pos = 0;
+            current_line = 0;
+            current_column = 0;
             err_pos = new List<int>();
             err = false;
         }
@@ -923,12 +927,15 @@ public bool Error()
 
         public int Position { get { return latest_pos; } }
 
-        public Tuple<string, string> Next()
+        public Tuple<string, string, int, int> Next()
         {
             var builder = new StringBuilder();
             var node_pos = 0;
             latest_pos = pos;
 
+            int cur_line = current_line;
+            int cur_column = current_column;
+
             for (; pos < target.Length; pos++)
             {
                 int next_transition = transition_table[node_pos][target[pos]];
@@ -944,6 +951,9 @@ public Tuple<string, string> Next()
                             latest_pos = pos;
                             pos--;
                             node_pos = 0;
+                            current_column--;
+                            cur_line = current_line;
+                            cur_column = current_column;
                             continue;
                         }
                         if (accept_table[node_pos] == null)
@@ -952,20 +962,21 @@ public Tuple<string, string> Next()
                             err_pos.Add(pos);
                             continue;
                         }
-                        return new Tuple<string, string>(accept_table[node_pos], builder.ToString());
+                        return new Tuple<string, string, int, int> (accept_table[node_pos], builder.ToString(), cur_line + 1, cur_column + 1);
 
                     default:
+                        if (target[pos] == '\n') { current_line++; current_column = 1; } else current_column++;
                         builder.Append(target[pos]);
                         break;
                 }
 
                 node_pos = next_transition;
             }
 
-            return new Tuple<string, string>(accept_table[node_pos], builder.ToString());
+            return new Tuple<string, string, int, int> (accept_table[node_pos], builder.ToString(), cur_line + 1, cur_column + 1);
         }
 
-        public Tuple<string, string> Lookahead()
+        public Tuple<string, string, int, int> Lookahead()
         {
             var npos = pos;
             var result = Next();