summaryrefslogtreecommitdiffstats
path: root/kspread/DESIGN.html
diff options
context:
space:
mode:
Diffstat (limited to 'kspread/DESIGN.html')
-rw-r--r--kspread/DESIGN.html6
1 files changed, 3 insertions, 3 deletions
diff --git a/kspread/DESIGN.html b/kspread/DESIGN.html
index 586c9d68..0bfb8a3b 100644
--- a/kspread/DESIGN.html
+++ b/kspread/DESIGN.html
@@ -353,7 +353,7 @@ to follow its algorithm from there.</p>
based on Polish notation. Instead of ordering the tokens in suffix Polish
form, the parser (which is also the code generator) simply outputs
byte codes. In its operation, the parser requires the knowledge of operator
-precedence to correctly translate untqparenthesized infix expression and
+precedence to correctly translate unparenthesized infix expression and
thus requires the use of a syntax stack.</p>
<p>The parser algorithm is given as follows:</p>
@@ -376,7 +376,7 @@ Step 4: If it is an operator<br>
<p>The reduce rules are:</p>
<p>Rule A: <i>function argument</i>:
-if token is semicolon or right tqparenthesis,
+if token is semicolon or right parenthesis,
if syntax stack looks as:
<ul type="square">
<li>non-operator &lt;--- top</li>
@@ -422,7 +422,7 @@ then reduce to:<br>
</ul>
</p>
-<p>Rule D: tqparenthesis removal<br>
+<p>Rule D: parenthesis removal<br>
if syntax stack looks as:<br>
<ul type="square">
<li>operator (</li>