added an example of a long fxgrep expression

diff --git a/helm/DEVEL/mathml_editor/doc/spec.tex b/helm/DEVEL/mathml_editor/doc/spec.tex
index de575c719ebb8887ce3d490da901cf854716eb50..93ca81a76ee11b9ceb8c696673ec000f3a8012e7 100644 (file)
--- a/helm/DEVEL/mathml_editor/doc/spec.tex
+++ b/helm/DEVEL/mathml_editor/doc/spec.tex
@@ -406,6 +406,19 @@ cursor with \ONODE{}, append $\tadvance$ after the \ONODE{} node
 
 \begin{description}
 
+  %********* rules that try to express situations completely specified (there is an effective deletion) ******
+
+  % in the rules below, a token is either an i node, an n node, an o node, an s node or an empty c node.
+  % an empty c node is either an undefined macro or an empty macro. These c node are handled as they actually were 
+  % tokens (i, n, o, s).
+
+  % there is an optional sequence of groups with id, all of which having one and only one child. The last
+  % child of this sequence (or the root, if the sequence is empty) is a group with id, has as first element a
+  % token and has as second and last element an eventually empty sequence of groups with id, all of which having
+  %one and only one child. The last element of this sequence has the cursor as its child.
+  \item{\verb+(g[@id][^*$]/++\verb+)?g[@id][^(i|n|o|s|c[ ])#$]/(g[@id][^*$]/++\verb+)?cursor+}\\
+  replace the whole fragment with the cursor.
+
   %*******************************************************************************************************
   %************** rules handling the case in which the cursor has a preceding node ***********************
   %*******************************************************************************************************