new API building Python script, does the C parsing directly, generates a

* doc/apibuild.py doc/libxml2-api.xml doc/Makefile.am: new API
  building Python script, does the C parsing directly, generates
  a better API description including structure fieds defs and
  enums. Still a couple of bugs, but good enough for the python
  wrappers now.
* DOCBparser.c SAX.c nanohttp.c parser.c parserInternals.c tree.c
  valid.c xmlIO.c xmlmemory.c xmlreader.c xmlregexp.c xmlschemas.c
  include/libxml/schemasInternals.h include/libxml/tree.h: more
  cleanup based on the python analysis script reports.
* libxml.spec.in: make sure the API XML description is part of the
  devel package.
Daniel
diff --git a/xmlregexp.c b/xmlregexp.c
index d902a11..129c126 100644
--- a/xmlregexp.c
+++ b/xmlregexp.c
@@ -3961,6 +3961,8 @@
  * xmlAutomataGetInitState:
  * @am: an automata
  *
+ * Initial state lookup
+ *
  * Returns the initial state of the automata
  */
 xmlAutomataStatePtr
@@ -4028,7 +4030,8 @@
  * @to: the target point of the transition or NULL
  * @token: the input string associated to that transition
  * @min:  the minimum successive occurences of token
- * @min:  the maximum successive occurences of token
+ * @max:  the maximum successive occurences of token
+ * @data:  data associated to the transition
  *
  * If @to is NULL, this create first a new target state in the automata
  * and then adds a transition from the @from state to the target state
@@ -4077,7 +4080,8 @@
  * @to: the target point of the transition or NULL
  * @token: the input string associated to that transition
  * @min:  the minimum successive occurences of token
- * @min:  the maximum successive occurences of token
+ * @max:  the maximum successive occurences of token
+ * @data:  data associated to the transition
  *
  * If @to is NULL, this create first a new target state in the automata
  * and then adds a transition from the @from state to the target state
@@ -4153,7 +4157,7 @@
 }
 
 /**
- * xmlAutomataNewTransition:
+ * xmlAutomataNewEpsilon:
  * @am: an automata
  * @from: the starting point of the transition
  * @to: the target point of the transition or NULL
@@ -4180,6 +4184,7 @@
  * @am: an automata
  * @from: the starting point of the transition
  * @to: the target point of the transition or NULL
+ * @lax: allow to transition if not all all transitions have been activated
  *
  * If @to is NULL, this create first a new target state in the automata
  * and then adds a an ALL transition from the @from state to the