From d988a70c0a6685f6d10e61eee676a5534eba3bb2 Mon Sep 17 00:00:00 2001 From: Ron Pinkas Date: Tue, 5 Dec 2000 16:23:40 +0000 Subject: [PATCH] Corrected few typos --- harbour/doc/simplex.txt | 17 +++++++++-------- 1 file changed, 9 insertions(+), 8 deletions(-) diff --git a/harbour/doc/simplex.txt b/harbour/doc/simplex.txt index 3bff1380db..91ccad62f7 100644 --- a/harbour/doc/simplex.txt +++ b/harbour/doc/simplex.txt @@ -39,25 +39,26 @@ Definitions are divided into 6 main sections: 4. Keywords. These are specific set of reserved words, which have lexical significance in the defined language, when appearing as the FIRST token - in a given source line. Keywords may be contrcuted of multiple words with - sperarting white space (ignorable delimiters), when using the predefined + in a given source line. Keywords may be constructed of multiple words with + separating white space (ignorable delimiters), when using the predefined match pattern {WS}. 5. Words. These are specific set of reserved words, which have lexical significance in the defined language, when appearing ANYWHERE in a given - source line. Words may be contrcuted of multiple words with sperarting white + source line. Words may be constructed of multiple words with separating white space (ignorable delimiters), when using the predefined match pattern {WS}. 6. Rules. There are 2 kinds of rules: a. Reduction Rules. These kind of rules defines the translation of a 1 or more tokens into 1 or more other tokens (or custom actions). Reductions - are infinitley recursive, which means that the Reduction Results, are - pushed back, incase they me in turn be part of yet another rule. To - eliminate such recursive cycle, Reduction Result may be in the form of - n + DONT_REDUCE, thus passing through the resulted token, without - further checks. + are infinitely recursive, which means that the Reduction Results, are + pushed back onto the evaluation stack, incase they might in turn be part + of yet another rule. To eliminate such recursive cycle, Reduction Result + may be in the form of N + DONT_REDUCE, thus passing through the resulted + token, without further evaluation. b. Pass Through (Left Associate). This kind of rules directs the Lexer to accept such token[s] as a valid form. +For a real-life language definition example, please refer to harbour.slx. \ No newline at end of file