From c12e0abb1d88053708882b0fa26be0cfc621b118 Mon Sep 17 00:00:00 2001 From: saurav Date: Fri, 14 Aug 2026 19:20:08 +0530 Subject: [PATCH 1/2] docs: upgrade SPPF documentation to Bootstrap 5 (fixes #1494) --- docs/_static/sppf/sppf.html | 32 ++++++++++++++++++-------------- 1 file changed, 18 insertions(+), 14 deletions(-) diff --git a/docs/_static/sppf/sppf.html b/docs/_static/sppf/sppf.html index c2fd532a8..247bd35a9 100644 --- a/docs/_static/sppf/sppf.html +++ b/docs/_static/sppf/sppf.html @@ -3,7 +3,10 @@ - + + Shared Packed Parse Forest (SPPF) + + @@ -70,12 +73,12 @@

Shared Packed Parse Forest (SPPF)

Then given input sentence $abcd$, the the following SPPF will be the result:

-
+
- + SPPF with intermediate nodes -
+

SPPF with intermediate nodes

@@ -86,12 +89,12 @@

SPPF with intermediate nodes

Suppose that the intermediate nodes had not been added to the SPPF. Then the nonterminal symbol nodes for $A$, $B$, $C$, and $D$ would have been attached to the nonterminal symbol node $S$:

-
+
- + SPPF without intermediate nodes -
+

SPPF without intermediate nodes

@@ -111,12 +114,12 @@

Adding cycles

Given input sentence $a$, there are infinitely many derivations. All these derivations are present in the following SPPF:

-
+
- + SPPF containing an infinite number of derivations -
+

SPPF containing an infinite number of derivations

@@ -132,12 +135,12 @@

Ambiguities

This gives the following SPPF:

-
+
- + SPPF containing an ambiguous root node -
+

SPPF containing an ambiguous root node

@@ -193,13 +196,14 @@

Transformation to an abstract Powered by the Academic theme for Hugo. -