grammar-composer 0.6.2 → 0.7.0

package/src/parser/Parser.ts

@@ -1,5 +1,5 @@
 import { isNumber } from '../utilities/Utilities.js'
-import { Grammar, GrammarElement, Terminal, type Nonterminal } from './Grammar.js'
+import { Grammar, GrammarNode, Terminal, type Nonterminal } from './Grammar.js'
 import { type FailedMatch, ParseError } from './ParseError.js'
 
 //////////////////////////////////////////////////////////////////////////////////////////////
@@ -34,22 +34,22 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 		}
 	}
 
-	function tryParse(grammarElement: GrammarElement, startOffset: number): ParseResult | null {
-		if (isNumber(grammarElement.cacheId)) {
-			return tryParseCached(grammarElement, startOffset)
+	function tryParse(grammarNode: GrammarNode, startOffset: number): ParseResult | null {
+		if (isNumber(grammarNode.cacheId)) {
+			return tryParseCached(grammarNode, startOffset)
 		} else {
-			return tryParseUncached(grammarElement, startOffset)
+			return tryParseUncached(grammarNode, startOffset)
 		}
 	}
 
-	function tryParseCached(grammarElement: GrammarElement, startOffset: number): ParseResult | null {
-		const cacheId = grammarElement.cacheId!
+	function tryParseCached(grammarNode: GrammarNode, startOffset: number): ParseResult | null {
+		const cacheId = grammarNode.cacheId!
 		const cacheKey = (startOffset * cacheKeyOffsetMultiplier) + cacheId
 
 		if (parseResultsCache.has(cacheKey)) {
 			return parseResultsCache.get(cacheKey)!
 		} else {
-			const parseResult = tryParseUncached(grammarElement, startOffset)
+			const parseResult = tryParseUncached(grammarNode, startOffset)
 
 			parseResultsCache.set(cacheKey, parseResult)
 
@@ -57,14 +57,14 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 		}
 	}
 
-	function tryParseUncached(grammarElement: GrammarElement, startOffset: number): ParseResult | null {
-		const result = tryParseElement(grammarElement, startOffset)
+	function tryParseUncached(grammarNode: GrammarNode, startOffset: number): ParseResult | null {
+		const result = tryParseNode(grammarNode, startOffset)
 
-		if (result === null && grammarElement.optional === true) {
-			// An optional element that doesn't match is "skipped": it succeeds
+		if (result === null && grammarNode.optional === true) {
+			// An optional node that doesn't match is "skipped": it succeeds
 			// by consuming no input and producing no nodes. This uniformly
 			// implements the `possibly()` "or skip" semantics wherever the
-			// element appears (sequence members, repetition content, choice
+			// node appears (sequence members, repetition content, choice
 			// members, or as the content of a production itself).
 			return { endOffset: startOffset, nodes: undefined, skipped: true }
 		}
@@ -72,14 +72,14 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 		return result
 	}
 
-	function tryParseElement(grammarElement: GrammarElement, startOffset: number): ParseResult | null {
-		switch (grammarElement.type) {
+	function tryParseNode(grammarNode: GrammarNode, startOffset: number): ParseResult | null {
+		switch (grammarNode.type) {
 			case 'StringTerminal': {
-				const target = grammarElement.content
+				const target = grammarNode.content
 				const endOffset = startOffset + target.length
 
 				if (endOffset > inputLength) {
-					updateBestFailedMatchesIfNeeded(grammarElement, startOffset)
+					updateBestFailedMatchesIfNeeded(grammarNode, startOffset)
 
 					return null
 				}
@@ -92,7 +92,7 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 						nodes: undefined
 					}
 				} else {
-					updateBestFailedMatchesIfNeeded(grammarElement, startOffset)
+					updateBestFailedMatchesIfNeeded(grammarNode, startOffset)
 
 					return null
 				}
@@ -101,10 +101,10 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 			case 'PatternTerminal': {
 				const substringToMatch = inputString.substring(startOffset)
 
-				const matchResults = grammarElement.regExp.exec(substringToMatch)
+				const matchResults = grammarNode.regExp.exec(substringToMatch)
 
 				if (matchResults === null) {
-					updateBestFailedMatchesIfNeeded(grammarElement, startOffset)
+					updateBestFailedMatchesIfNeeded(grammarNode, startOffset)
 
 					return null
 				}
@@ -177,9 +177,9 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 			}
 
 			case 'Nonterminal': {
-				nonterminalStack.push(grammarElement)
+				nonterminalStack.push(grammarNode)
 
-				const result = tryParse(grammarElement.content, startOffset)
+				const result = tryParse(grammarNode.content, startOffset)
 
 				nonterminalStack.pop()
 
@@ -194,9 +194,9 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 					return { endOffset: startOffset, nodes: undefined, skipped: true }
 				}
 
-				const grammarElementName = grammarElement.name
+				const grammarNodeName = grammarNode.name
 
-				if (grammarElement.unwrapped) {
+				if (grammarNode.unfolded) {
 					const newResult: ParseResult = {
 						endOffset: result.endOffset,
 						nodes: result.nodes
@@ -205,7 +205,7 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 					return newResult
 				} else {
 					const newNode: ParseTreeNode = {
-						name: grammarElementName,
+						name: grammarNodeName,
 
 						startOffset,
 						endOffset: result.endOffset,
@@ -228,14 +228,14 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 				let successfulResults: ParseResult[] = []
 				let readOffset = startOffset
 
-				for (const element of grammarElement.members) {
-					const elementResult = tryParse(element, readOffset)
+				for (const node of grammarNode.members) {
+					const parseResult = tryParse(node, readOffset)
 
-					if (elementResult !== null) {
-						successfulResults.push(elementResult)
+					if (parseResult !== null) {
+						successfulResults.push(parseResult)
 
-						readOffset = elementResult.endOffset
-					} else if (element.optional === false) {
+						readOffset = parseResult.endOffset
+					} else if (node.optional === false) {
 						return null
 					}
 				}
@@ -260,7 +260,7 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 				const nodes: ParseTreeNode[] = []
 
 				while (true) {
-					const result = tryParse(grammarElement.content, readOffset)
+					const result = tryParse(grammarNode.content, readOffset)
 
 					if (result === null) {
 						break
@@ -282,7 +282,7 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 						endOffset: readOffset,
 						nodes: nodes.length > 0 ? nodes : undefined
 					}
-				} else if (grammarElement.optional === true) {
+				} else if (grammarNode.optional === true) {
 					return {
 						endOffset: startOffset,
 						nodes: undefined
@@ -295,13 +295,13 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 			case 'Choice': {
 				let bestResult: ParseResult | null = null
 
-				for (const member of grammarElement.members) {
+				for (const member of grammarNode.members) {
 					const result = tryParse(member, startOffset)
 
 					if (result !== null && (bestResult === null || result.endOffset > bestResult.endOffset)) {
 						bestResult = result
 
-						if (grammarElement.exhaustive === false) {
+						if (grammarNode.exhaustive === false) {
 							break
 						}
 					}
@@ -311,12 +311,12 @@ export function parse(inputString: string, grammar: Grammar<any>, options?: Pars
 			}
 
 			default: {
-				throw new Error(`Unsupported grammar element type '${(grammarElement as any).type}'.`)
+				throw new Error(`Unrecognized grammar node type '${(grammarNode as any).type}'.`)
 			}
 		}
 	}
 
-	const result = tryParse(grammar.rootElement, 0)
+	const result = tryParse(grammar.rootNode, 0)
 
 	if (result && result.endOffset >= inputLength) {
 		return result.nodes ?? []
@@ -341,7 +341,7 @@ export interface ParseResult {
 	endOffset: number
 	nodes: ParseTreeNode[] | undefined
 
-	// Marks a result produced by an optional element that was "skipped" (it
+	// Marks a result produced by an optional node that was "skipped" (it
 	// didn't match, so the parse succeeded by consuming no input and producing
 	// no nodes). Set internally by the parser; a receiving `Nonterminal` uses
 	// it to avoid creating a node for skipped content.

package/src/parser/StaticAnalysis.ts

@@ -1,17 +1,17 @@
 import { Pattern } from 'regexp-composer'
 import { isArray, isBoolean, isString } from '../utilities/Utilities.js'
-import { GrammarElement } from './Grammar.js'
+import { GrammarNode } from './Grammar.js'
 
 /////////////////////////////////////////////////////////////////////////////////////////////////
 // Internal static analysis methods
 /////////////////////////////////////////////////////////////////////////////////////////////////
-export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
-	const visitedNodes = new Set<GrammarElement>()
+export function detectAndAnnotateOptionalNodes(rootNode: GrammarNode) {
+	const visitedNodes = new Set<GrammarNode>()
 
-	const resolvedNodes = new Map<GrammarElement, boolean>()
-	const unresolvedNodes = new Map<GrammarElement, { dependencies: Set<GrammarElement>, isChoice: boolean }>()
+	const resolvedNodes = new Map<GrammarNode, boolean>()
+	const unresolvedNodes = new Map<GrammarNode, { dependencies: Set<GrammarNode>, isChoice: boolean }>()
 
-	function processDepthFirst(node: GrammarElement): boolean | undefined {
+	function processDepthFirst(node: GrammarNode): boolean | undefined {
 		if (visitedNodes.has(node)) {
 			return resolvedNodes.get(node)
 		}
@@ -46,19 +46,19 @@ export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
 			}
 
 			case 'Sequence': {
-				const dependencies = new Set<GrammarElement>()
+				const dependencies = new Set<GrammarNode>()
 
 				let hasNonOptionalResolvedMember = false
 
-				for (const element of node.members) {
-					const result = processDepthFirst(element)
+				for (const member of node.members) {
+					const result = processDepthFirst(member)
 
 					if (isBoolean(result)) {
 						if (result === false) {
 							hasNonOptionalResolvedMember = true
 						}
 					} else {
-						dependencies.add(element)
+						dependencies.add(member)
 					}
 				}
 
@@ -82,18 +82,18 @@ export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
 			}
 
 			case 'Choice': {
-				const dependencies = new Set<GrammarElement>()
+				const dependencies = new Set<GrammarNode>()
 				let hasOptionalResolvedMember = false
 
-				for (const element of node.members) {
-					const result = processDepthFirst(element)
+				for (const member of node.members) {
+					const result = processDepthFirst(member)
 
 					if (isBoolean(result)) {
 						if (result === true) {
 							hasOptionalResolvedMember = true
 						}
 					} else {
-						dependencies.add(element)
+						dependencies.add(member)
 					}
 				}
 
@@ -132,7 +132,7 @@ export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
 		// and we should exit the loop.
 		let atLastOneDependencyResolvedInAnyNode = false
 
-		const nodesToDelete: GrammarElement[] = []
+		const nodesToDelete: GrammarNode[] = []
 
 		// Scan the unresolved nodes to locate any new resolved dependencies
 		for (const [node, { dependencies, isChoice }] of unresolvedNodes) {
@@ -151,12 +151,14 @@ export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
 						if (value === true) {
 							resolvedNodes.set(node, true)
 							nodeResolved = true
+
 							break
 						}
 					} else {
 						if (value === false) {
 							resolvedNodes.set(node, false)
 							nodeResolved = true
+
 							break
 						}
 					}
@@ -204,10 +206,10 @@ export function detectAndAnnotateOptionalNodes(rootNode: GrammarElement) {
 	}
 }
 
-export function detectAndErrorOnLeftRecursion(rootNode: GrammarElement) {
-	const currentlyIteratedNodes = new Set<GrammarElement>()
+export function detectAndErrorOnLeftRecursion(rootNode: GrammarNode) {
+	const currentlyIteratedNodes = new Set<GrammarNode>()
 
-	function detect(node: GrammarElement) {
+	function detect(node: GrammarNode) {
 		if (currentlyIteratedNodes.has(node)) {
 			if (node.type === 'Nonterminal') {
 				throw new Error(`Detected left recursion for nonterminal '${node.name}'.`)

package/src/parser/{TerminalToText.ts → TerminalFormatter.ts}

@@ -4,7 +4,7 @@ import type { PatternTerminal, StringTerminal, Terminal } from './Grammar.js'
 /////////////////////////////////////////////////////////////////////////////////////////////////
 // Terminal to text conversion
 /////////////////////////////////////////////////////////////////////////////////////////////////
-export class TerminalToText {
+export class TerminalFormatter {
 	constructor(private stringifiedLengthLimit: number) {
 	}
 

package/src/tests/Test.ts

@@ -1,9 +1,9 @@
 import { Timer } from '../utilities/Timer.js'
 import { jsonSample1, jsonSample2 } from './test-data/TestData.js'
 import { anyOf, buildGrammar } from '../exports/Exports.js'
-import { JsonGrammar, jsonGrammarUnwrappedNonterminalNames } from './test-grammars/JsonGrammar.js'
-import { XmlGrammar, xmlGrammarUnwrappedNonterminalNames } from './test-grammars/XmlGrammar.js'
-import { RegExpGrammar, regExpGrammarUnwrappedNonterminalNames } from './test-grammars/RegExpGrammar.js'
+import { JsonGrammar, jsonGrammarUnfoldedNonterminalNames } from './test-grammars/JsonGrammar.js'
+import { XmlGrammar, xmlGrammarUnfoldedNonterminalNames } from './test-grammars/XmlGrammar.js'
+import { RegExpGrammar, regExpGrammarUnfoldedNonterminalNames } from './test-grammars/RegExpGrammar.js'
 import { writeFile } from 'fs/promises'
 import { SimpleTestGrammar1 } from './test-grammars/SimpleTestGrammar1.js'
 
@@ -31,7 +31,7 @@ function testJsonParser() {
 	const jsonString = jsonSample1
 
 	const grammar = buildGrammar(JsonGrammar, 'expression', {
-		unwrappedNonterminalNames: jsonGrammarUnwrappedNonterminalNames
+		unfoldedNonterminalNames: jsonGrammarUnfoldedNonterminalNames
 	})
 
 	const iterations = 1000
@@ -66,7 +66,7 @@ async function testXmlParser() {
 `
 	// Build the grammar. 'document' is the starting production
 	const grammar = buildGrammar(XmlGrammar, 'document', {
-		unwrappedNonterminalNames: xmlGrammarUnwrappedNonterminalNames
+		unfoldedNonterminalNames: xmlGrammarUnfoldedNonterminalNames
 	})
 
 	// Parse the XML string
@@ -87,7 +87,7 @@ async function testRegExpParser() {
 	//const regExpString = '(abcd)(aa))'
 
 	const grammar = buildGrammar(RegExpGrammar, 'root', {
-		unwrappedNonterminalNames: regExpGrammarUnwrappedNonterminalNames
+		unfoldedNonterminalNames: regExpGrammarUnfoldedNonterminalNames
 	})
 
 	const parseTree = grammar.parse(regExpString)

package/src/tests/test-grammars/JsonGrammar.ts

@@ -115,9 +115,9 @@ function createPatternWithClearedWhitespace(subpattern: R.Pattern) {
 const zeroOrMoreWhitespace = R.zeroOrMore(R.whitespace)
 
 //////////////////////////////////////////////////////////////////////////////////////////////
-// Wrapped nonterminal names
+// Unfolded nonterminal list
 //////////////////////////////////////////////////////////////////////////////////////////////
-export const jsonGrammarUnwrappedNonterminalNames: G.GrammarNonterminalNames<JsonGrammar> = [
+export const jsonGrammarUnfoldedNonterminalNames: G.GrammarNonterminalNames<JsonGrammar> = [
 	//'stringLiteral',
 	//'numberLiteral',
 	//'booleanLiteral',

package/src/tests/test-grammars/RegExpGrammar.ts

@@ -394,9 +394,9 @@ const escapedChars = {
 }
 
 //////////////////////////////////////////////////////////////////////////////////////////////
-// Wrapped nonterminal names
+// Unfolded nonterminal list
 //////////////////////////////////////////////////////////////////////////////////////////////
-export const regExpGrammarUnwrappedNonterminalNames: G.GrammarNonterminalNames<RegExpGrammar> = [
+export const regExpGrammarUnfoldedNonterminalNames: G.GrammarNonterminalNames<RegExpGrammar> = [
 	'disjunctionOrSequence',
 	'group',
 	'backReference',

package/src/tests/test-grammars/XmlGrammar.ts

@@ -144,9 +144,9 @@ const quotedString = R.anyOf(
 )
 
 //////////////////////////////////////////////////////////////////////////////////////////////
-// Wrapped nonterminal names
+// Unfolded nonterminal list
 //////////////////////////////////////////////////////////////////////////////////////////////
-export const xmlGrammarUnwrappedNonterminalNames: G.GrammarNonterminalNames<XmlGrammar> = [
+export const xmlGrammarUnfoldedNonterminalNames: G.GrammarNonterminalNames<XmlGrammar> = [
 	'openingTagStart',
 	'tagEnd',
 	'declarationTagOpening',

package/dist/parser/TerminalToText.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TerminalToText.d.ts","sourceRoot":"","sources":["../../src/parser/TerminalToText.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAC5D,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAA;AAK7E,qBAAa,cAAc;IACd,OAAO,CAAC,sBAAsB;IAA1C,YAAoB,sBAAsB,EAAE,MAAM,EACjD;IAED,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAM5C;IAED,uBAAuB,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM,CAExD;IAED,wBAAwB,CAAC,QAAQ,EAAE,eAAe,UAmBjD;IAED,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CA+FzC;IAED,6BAA6B,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAUlD;IAED,qBAAqB,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAgBjD;IAED,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAMvD;CACD;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAgB/C"}

package/dist/parser/TerminalToText.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TerminalToText.js","sourceRoot":"","sources":["../../src/parser/TerminalToText.ts"],"names":[],"mappings":"AAGA,iGAAiG;AACjG,8BAA8B;AAC9B,iGAAiG;AACjG,MAAM,OAAO,cAAc;IACN,sBAAsB;IAA1C,YAAoB,sBAA8B;sCAA9B,sBAAsB;IAC1C,CAAC;IAED,iBAAiB,CAAC,QAAkB;QACnC,IAAI,QAAQ,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAA;QAC9C,CAAC;aAAM,CAAC;YACP,OAAO,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAA;QAC/C,CAAC;IACF,CAAC;IAED,uBAAuB,CAAC,QAAwB;QAC/C,OAAO,IAAI,CAAC,6BAA6B,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;IAC5D,CAAC;IAED,wBAAwB,CAAC,QAAyB;QACjD,IAAI,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAA;QAE9B,iFAAiF;QACjF,mEAAmE;QACnE,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YAE/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,OAAO,YAAY,KAAK,QAAQ;gBACnE,YAAY,CAAC,IAAI,KAAK,cAAc,IAAI,YAAY,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAE7E,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YAC3B,CAAC;QACF,CAAC;QAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;QACzD,MAAM,2BAA2B,GAAG,IAAI,CAAC,cAAc,CAAC,kBAAkB,EAAE,IAAI,CAAC,sBAAsB,CAAC,CAAA;QAExG,OAAO,2BAA2B,CAAA;IACnC,CAAC;IAED,gBAAgB,CAAC,OAAgB;QAChC,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,6BAA6B,CAAC,OAAO,CAAC,CAAA;QACnD,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;QAClF,CAAC;QAED,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;YACtB,KAAK,cAAc,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAA;YAC3C,CAAC;YAED,KAAK,UAAU,EAAE,CAAC;gBACjB,OAAO,YAAY,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAC7D,CAAC;YAED,KAAK,YAAY,EAAE,CAAC;gBACnB,OAAO,cAAc,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAC/D,CAAC;YAED,KAAK,WAAW,EAAE,CAAC;gBAClB,OAAO,aAAa,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAC9D,CAAC;YAED,KAAK,UAAU,EAAE,CAAC;gBACjB,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;gBACtC,MAAM,kBAAkB,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;gBAEjE,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC3B,OAAO,YAAY,QAAQ,KAAK,kBAAkB,GAAG,CAAA;gBACtD,CAAC;qBAAM,IAAI,QAAQ,KAAK,MAAM,CAAC,iBAAiB,EAAE,CAAC;oBAClD,OAAO,aAAa,QAAQ,WAAW,kBAAkB,GAAG,CAAA;gBAC7D,CAAC;qBAAM,CAAC;oBACP,OAAO,aAAa,QAAQ,KAAK,QAAQ,MAAM,kBAAkB,GAAG,CAAA;gBACrE,CAAC;YACF,CAAC;YAED,KAAK,SAAS,EAAE,CAAC;gBAChB,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAChC,OAAO,OAAO,CAAC,IAAI,CAAA;gBACpB,CAAC;gBAED,OAAO,IAAI,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YACrD,CAAC;YAED,KAAK,OAAO,EAAE,CAAC;gBACd,MAAM,kBAAkB,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAA;gBAE3F,IAAI,WAAW,GAAG,SAAS,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;gBAE3D,IAAI,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,sBAAsB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvF,WAAW,GAAG,SAAS,kBAAkB,CAAC,CAAC,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,QAAQ,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAA;gBACnI,CAAC;gBAED,OAAO,WAAW,CAAA;YACnB,CAAC;YAED,KAAK,eAAe,EAAE,CAAC;gBACtB,MAAM,kBAAkB,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAA;gBAE3F,OAAO,iBAAiB,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;YACzD,CAAC;YAED,KAAK,YAAY,EAAE,CAAC;gBACnB,OAAO,cAAc,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAC/D,CAAC;YAED,KAAK,eAAe,EAAE,CAAC;gBACtB,OAAO,iBAAiB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAClE,CAAC;YAED,KAAK,YAAY,EAAE,CAAC;gBACnB,OAAO,cAAc,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAC/D,CAAC;YAED,KAAK,eAAe,EAAE,CAAC;gBACtB,OAAO,iBAAiB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAA;YAClE,CAAC;YAED,KAAK,QAAQ,EAAE,CAAC;gBACf,MAAM,uBAAuB,GAAG,OAAO,CAAC,uBAAuB,CAAA;gBAE/D,IAAI,OAAO,uBAAuB,KAAK,QAAQ,EAAE,CAAC;oBACjD,OAAO,WAAW,uBAAuB,IAAI,CAAA;gBAC9C,CAAC;qBAAM,CAAC;oBACP,OAAO,UAAU,uBAAuB,GAAG,CAAA;gBAC5C,CAAC;YACF,CAAC;YAED,SAAS,CAAC;gBACT,MAAM,IAAI,KAAK,CAAC,8BAA+B,OAAe,CAAC,IAAI,GAAG,CAAC,CAAA;YACxE,CAAC;QACF,CAAC;IACF,CAAC;IAED,6BAA6B,CAAC,IAAY;QACzC,IAAI,MAAM,GAAG,EAAE,CAAA;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;YAEpC,MAAM,IAAI,WAAW,CAAA;QACtB,CAAC;QAED,OAAO,IAAI,MAAM,GAAG,CAAA;IACrB,CAAC;IAED,qBAAqB,CAAC,KAAmB;QACxC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;YAE9C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7D,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;gBAE5E,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,OAAO,cAAc,SAAS,OAAO,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAA;gBAClF,CAAC;YACF,CAAC;QACF,CAAC;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,IAAI,CAAA;QAClB,CAAC;QAED,OAAO,KAAK,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,cAAc,CAAC,GAAW,EAAE,WAAmB;QAC9C,IAAI,GAAG,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YAC/B,OAAO,GAAG,CAAA;QACX,CAAC;QAED,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,GAAG,CAAA;IAC/C,CAAC;CACD;AAED,MAAM,UAAU,UAAU,CAAC,IAAY;IACtC,MAAM,WAAW,GAA2B;QAC3C,IAAI,EAAE,MAAM;QACZ,GAAG,EAAE,KAAK;QACV,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,KAAK;KACX,CAAA;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;IAEpC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,UAAU,CAAA;IAClB,CAAC;SAAM,CAAC;QACP,OAAO,IAAI,CAAA;IACZ,CAAC;AACF,CAAC"}