Changeset 3980 for applications/trunk/LFC/Earley/Earley.ref

Timestamp:

Oct 19, 2008, 12:45:34 AM (12 years ago)

Author:

orlov

Message:

• Earley algorithm in Refal-5 without repeated et-variables.

File:

• applications/trunk/LFC/Earley/Earley.ref (modified) (3 diffs)

applications/trunk/LFC/Earley/Earley.ref

@@ -8 +8 @@
 
 Check {
-  (e.grammar) (TYPE t.name) e.string,
-    <Parse (e.grammar) (e.string) () (((TYPE START) (DOT (TYPE t.name)) ())) () ()> : e.sets (e.last) =
-    <FindSuccessRule t.name e.last>;
+  (e.grammar) (TYPE s.name) e.string,
+    <Parse (e.grammar) (e.string) () (((TYPE START) (DOT (TYPE s.name)) ())) () ()> : e.sets (e.last) =
+    <FindSuccessRule s.name e.last>;
 }
 
 FindSuccessRule {
-  t.name ((TYPE t.name e.info) e.prod (DOT) ()) e.rules = (e.info) (e.prod);
-  t.name t.rule e.rules = <FindSuccessRule t.name e.rules>;
-  t.name = "Parsing failed";
+  s.name ((TYPE s.name e.info) e.prod (DOT) ()) e.rules = (e.info) (e.prod);
+  s.name t.rule e.rules = <FindSuccessRule s.name e.rules>;
+  s.name = "Parsing failed";
 }
 
@@ -30 +30 @@
   (e.grammar) (e.string) (e.step) e.sets (t.rule e.rules) (e.current) (e.next), t.rule : {
 * Scanner
-    ((TYPE t.name e.info) e.1 (DOT s.char e.2) (e.n)), e.string : {
+    ((TYPE s.name e.info) e.1 (DOT s.char e.2) (e.n)), e.string : {
       s.char e.rest_chars =
         <Parse (e.grammar) (e.string) (e.step) e.sets (e.rules) (e.current t.rule)
-          (e.next ((TYPE t.name e.info s.char) e.1 s.char (DOT e.2) (e.n)))>;
+          (e.next ((TYPE s.name e.info s.char) e.1 s.char (DOT e.2) (e.n)))>;
       e.string =
         <Parse (e.grammar) (e.string) (e.step) e.sets (e.rules) (e.current t.rule) (e.next)>;
     };
 * Predictor
-    (t.type e.1 (DOT (TYPE t.name) e.2) (e.n)),
+    (t.type e.1 (DOT (TYPE s.name) e.2) (e.n)),
       e.current t.rule : e.current2 =
       <Parse (e.grammar) (e.string) (e.step) e.sets
-        (<AddPredictions (e.grammar) (e.rules) (e.current2) t.name (e.step)>) (e.current2) (e.next)>;
+        (<AddPredictions (e.grammar) (e.rules) (e.current2) s.name (e.step)>) (e.current2) (e.next)>;
 * Completer
-    ((TYPE t.name e.info) e.1 (DOT) (e.n)),
+    ((TYPE s.name e.info) e.1 (DOT) (e.n)),
       e.current t.rule : e.current2 =
       <Parse (e.grammar) (e.string) (e.step) e.sets
-        (<AddCompletions (e.n) (e.sets) (e.rules) (e.current2) t.name e.info>) (e.current2) (e.next)>;
+        (<AddCompletions (e.n) (e.sets) (e.rules) (e.current2) s.name e.info>) (e.current2) (e.next)>;
   };
 }
 
 AddPredictions {
-  ((PROD (TYPE t.name) e.prods) e.grammar) (e.rules) (e.current) t.name (e.step) =
-    <AddPredictions (e.grammar) (<AddPredictions2 (e.prods) (e.rules) (e.current) t.name (e.step)>) (e.current) t.name (e.step)>;
-  (t.prod e.grammar) (e.rules) (e.current) t.name (e.step) = <AddPredictions (e.grammar) (e.rules) (e.current) t.name (e.step)>;
-  () (e.rules) (e.current) t.name (e.step) = e.rules;
+  ((PROD (TYPE s.name) e.prods) e.grammar) (e.rules) (e.current) s.name (e.step) =
+    <AddPredictions (e.grammar) (<AddPredictions2 (e.prods) (e.rules) (e.current) s.name (e.step)>) (e.current) s.name (e.step)>;
+  (t.prod e.grammar) (e.rules) (e.current) s.name (e.step) = <AddPredictions (e.grammar) (e.rules) (e.current) s.name (e.step)>;
+  () (e.rules) (e.current) s.name (e.step) = e.rules;
 }
 
 AddPredictions2 {
-  ((e.prod) e.rest_prods) (e.rules) (e.current) t.name (e.step),
-    ((TYPE t.name) (DOT e.prod) (e.step)) : t.prediction,
+  ((e.prod) e.rest_prods) (e.rules) (e.current) s.name (e.step),
+    ((TYPE s.name) (DOT e.prod) (e.step)) : t.prediction,
     <IsIn e.rules t.prediction> : {
-      True = <AddPredictions2 (e.rest_prods) (e.rules) (e.current) t.name (e.step)>;
+      True = <AddPredictions2 (e.rest_prods) (e.rules) (e.current) s.name (e.step)>;
       False, <IsIn e.current t.prediction> : {
-        True = <AddPredictions2 (e.rest_prods) (e.rules) (e.current) t.name (e.step)>;
-        False = <AddPredictions2 (e.rest_prods) (e.rules t.prediction) (e.current) t.name (e.step)>;
+        True = <AddPredictions2 (e.rest_prods) (e.rules) (e.current) s.name (e.step)>;
+        False = <AddPredictions2 (e.rest_prods) (e.rules t.prediction) (e.current) s.name (e.step)>;
       };
     };
-  () (e.rules) (e.current) t.name (e.step) = e.rules;
+  () (e.rules) (e.current) s.name (e.step) = e.rules;
 }
 
 AddCompletions {
-  (I e.n) (t.set e.rest_sets) (e.rules) (e.current) t.name e.info = <AddCompletions (e.n) (e.rest_sets) (e.rules) (e.current) t.name e.info>;
-  () ((e.set) e.rest_sets) (e.rules) (e.current) t.name e.info = <AddCompletions2 (e.set) (e.rules) (e.current) t.name e.info>;
-  () () (e.rules) (e.current) t.name e.info = e.rules;
+  (I e.n) (t.set e.rest_sets) (e.rules) (e.current) s.name e.info = <AddCompletions (e.n) (e.rest_sets) (e.rules) (e.current) s.name e.info>;
+  () ((e.set) e.rest_sets) (e.rules) (e.current) s.name e.info = <AddCompletions2 (e.set) (e.rules) (e.current) s.name e.info>;
+  () () (e.rules) (e.current) s.name e.info = e.rules;
 }
 
 AddCompletions2 {
-  (((TYPE t.name2 e.info2) e.1 (DOT (TYPE t.name) e.2) (e.step)) e.set) (e.rules) (e.current) t.name e.info,
-    ((TYPE t.name2 e.info2 (e.info)) e.1 (TYPE t.name) (DOT e.2) (e.step)) : t.completion,
+  (((TYPE s.name2 e.info2) e.1 (DOT (TYPE s.name) e.2) (e.step)) e.set) (e.rules) (e.current) s.name e.info,
+    ((TYPE s.name2 e.info2 (e.info)) e.1 (TYPE s.name) (DOT e.2) (e.step)) : t.completion,
     <IsIn e.rules t.completion> : {
-      True = <AddCompletions2 (e.set) (e.rules) (e.current) t.name e.info>;
+      True = <AddCompletions2 (e.set) (e.rules) (e.current) s.name e.info>;
       False, <IsIn e.current t.completion> : {
-        True = <AddCompletions2 (e.set) (e.rules) (e.current) t.name e.info>;
-        False = <AddCompletions2 (e.set) (e.rules t.completion) (e.current) t.name e.info>;
+        True = <AddCompletions2 (e.set) (e.rules) (e.current) s.name e.info>;
+        False = <AddCompletions2 (e.set) (e.rules t.completion) (e.current) s.name e.info>;
       };
     };
-  (t.rule e.set) (e.rules) (e.current) t.name e.info = <AddCompletions2 (e.set) (e.rules) (e.current) t.name e.info>;
-  () (e.rules) (e.current) t.name e.info = e.rules;
+  (t.rule e.set) (e.rules) (e.current) s.name e.info = <AddCompletions2 (e.set) (e.rules) (e.current) s.name e.info>;
+  () (e.rules) (e.current) s.name e.info = e.rules;
 }
 
@@ -99 +99 @@
   = <Prout
 * E -> E '+' E | 'n'
-      <Check ((PROD (TYPE ('E')) ((TYPE ('E')) '+' (TYPE ('E'))) ('n'))) (TYPE ('E')) 'n+n'> '\n'
-      <Check ((PROD (TYPE ('E')) ((TYPE ('E')) '+' (TYPE ('E')))) (PROD (TYPE ('E')) ('n'))) (TYPE ('E')) 'n+n+n'>>;
+      <Check ((PROD (TYPE "E") ((TYPE "E") '+' (TYPE "E")) ('n'))) (TYPE "E") 'n+n'> '\n'
+      <Check ((PROD (TYPE "E") ((TYPE "E") '+' (TYPE "E"))) (PROD (TYPE "E") ('n'))) (TYPE "E") 'n+n+n'>>;
 }