An update of the graph regex system allows greater flexibility, with a more...

An update of the graph regex system allows greater flexibility, with a more advanced node matching system.

* [x] Making the nodeTest
  * [x] Making the lexer for logique expression
    * [x] Define operations tokens
    * [x] support int
    * [x] support str
    * [x] support float
  * [x] automatique Tests
  * [x] Making the parseur for logique expression
    * [x] Add the pratt for logical operation
  * [x] Making an interpreter to produce the node fuction test
    * [x] Add type safe type for the AST interpretation ( like std::any c17 ?) @pineapple
    * [x] Add the custome Lambda function @olivierbichler
    * [x] Add the bool node User functions
* [x] Making graphRegex
  * [x] support sequential match
    * [x] \*
    * [x] \+
  * [x] support paralel match
    * [x] \*
    * [x] \+
  * [x] Making lexer
    * [x] quantification tokens
      * [x] \*
      * [x] \+
    * [x] groupe token
  * [x] Making parseur
    * [x] seqential AST
    * [x] paralel AST
  * [x] Making Fsm interpreter
    * [x] define the fsm graph
    * [x] run FSM
  * [x] Making str interpreter (debug only)
* [x] CI
  * [x] auto test matching
  * [x] manual test matching