Résolution de la récursion du parse

source/engine/parseReference.js

@@ -16,7 +16,7 @@ export let parseReference = (rules, rule, parsedRules, filter) => ({
 	let partialReference = fragments.join(' . '),
 		dottedName = disambiguateRuleReference(rules, rule, partialReference)
 
-	let variable =
+	let parsedRule =
 		parsedRules[dottedName] ||
 		(console.log('uncached : from `', rule.dottedName, '` to `', dottedName) ||
 			parseRule(rules, findRuleByDottedName(rules, dottedName), parsedRules))
@@ -28,7 +28,10 @@ export let parseReference = (rules, rule, parsedRules, filter) => ({
 			cached = cache[cacheName]
 
 		if (cached) return cached
-		let variableHasFormula = variable.formule != null,
+
+		let variable =
+				typeof parsedRule === 'object' ? parsedRule : parsedRules[dottedName],
+			variableHasFormula = variable.formule != null,
 			variableHasCond =
 				variable['applicable si'] != null ||
 				variable['non applicable si'] != null ||

source/engine/parseRule.js

@@ -9,6 +9,8 @@ import { parse } from 'Engine/parse'
 
 export default (rules, rule, parsedRules) => {
 	if (parsedRules[rule.dottedName]) return parsedRules[rule.dottedName]
+
+	parsedRules[rule.dottedName] = 'being parsed'
 	/*
 		The parseRule function will traverse the tree of the `rule` and produce an AST, an object containing other objects containing other objects...
 		Some of the attributes of the rule are dynamic, they need to be parsed. It is the case of  `non applicable si`, `applicable si`, `formule`.