Fixed many typos

doc/ragel/RELEASE_NOTES_V4

@@ -12,7 +12,7 @@ that may be added into or out of the state.
 
 In the following example act is executed on the transitions for 't' and 'y'.
 Even though it is only embedded in the context of the first alternative. This
-is because after matching 'hi ', the machine has not yet distinguished beween
+is because after matching 'hi ', the machine has not yet distinguished between
 the two threads. The machine is simultaneously in the state expecting 'there'
 and the state expecting 'you'.
 
@@ -47,7 +47,7 @@ only a single action embedded. An example follows below.
 
 Now Gone:
 
-1. The use of >@ for selecting the states to modfiy (as in >@/ to embed eof
+1. The use of >@ for selecting the states to modify (as in >@/ to embed eof
    actions, etc) has been removed. This prefix meant start state OR not start AND
    not final.
 
@@ -129,7 +129,7 @@ The embedding types are:
     err             -- an error action into a state
     lerr            -- a local error action into a state
 
-The possible modfiers:
+The possible modifiers:
     on name         -- specify a name for priority and local error embedding
 
 Character-Level Negation '^' Added (4.1)
@@ -149,7 +149,7 @@ Discontinued Plus Sign To Specifify Positive Literal Numbers (4.1)
 The use of + to specify a literal number as positive has been removed. This
 notation is redundant because all literals are positive by default. It was
 unlikely to be used but was provided for consistency. This notation caused an
-ambiguity with the '+' repetition operator. Due to this ambibuity, and the fact
+ambiguity with the '+' repetition operator. Due to this ambiguity, and the fact
 that it is unlikely to be used and is completely unnecessary when it is, it has
 been removed. This simplifies the design. It elimnates possible confusion and
 removes the need to explain why the ambiguity exists and how it is resolved.
@@ -169,7 +169,7 @@ changed, precedence is now given to the subtraction operator.
 This change is for two reasons: A) The subtraction operator is far more common
 than negative literal numbers. I have quite often been fooled by writing
 (any-0) and having it parsed as ( any . -0 ) rather than ( any - 0 ) as I
-wanted.  B) In the definition of concatentation I want to maintain that
+wanted.  B) In the definition of concatenation I want to maintain that
 concatenation is used only when there are no other binary operators separating
 two machines.  In the case of (any-0) there is an operator separating the
 machines and parsing this as the concatenation of (any . -0) violates this
@@ -279,7 +279,7 @@ This change is summarized by:
   transitions, their action will not be triggerend on EOF in non-final states.
  -Addition of EOF action embedding operators for all classes of states to make
   up for functionality removed from other operators. These are >/ $/ @/ %/.
- -Start transition operator '>' does not imply leaving transtions when start
+ -Start transition operator '>' does not imply leaving transitions when start
   state is final.
 
 This change results in a simpler and more direct relationship between the
@@ -288,9 +288,9 @@ the special cases within the operators that require you to stop and think as
 you program in Ragel.
 
 Previously, the pending out transition operator % simultaneously served two
-purposes. First, to embed actions to that are to get transfered to transitions
+purposes. First, to embed actions to that are to get transferred to transitions
 made going out of the machine. These transitions are created by the
-concatentation and kleene star operators. Second, to specify actions that get
+concatenation and kleene star operators. Second, to specify actions that get
 executed on EOF should the final state in the machine to which the operator is
 applied remain final.
 
@@ -301,7 +301,7 @@ using the EOF operator %/action.
 
 Also note that when generating dot file output of a specific component of a
 machine that has leaving transitions embedded in the final states, these
-transitions will no longer show up since leaving transtion operator no longer
+transitions will no longer show up since leaving transition operator no longer
 causes actions to be moved into the the EOF event when the state they are
 embeeded into becomes a final state of the final machine.
 
@@ -313,7 +313,7 @@ to the alphabet type. The element type however is usually not specified as
 const and in most cases the data pointer in the machine's execute function
 should be a const pointer. Therefore ragel now makes the element type default
 to a constant version of the alphabet type. This can always be changed by using
-the element statment. For example 'element char;' will result in a non-const
+the element statement. For example 'element char;' will result in a non-const
 data pointer.
 
 New Interface Examples (4.0)

doc/ragel/RELEASE_NOTES_V5

@@ -21,7 +21,7 @@ host code as straightforward as possible. This will ease the addition of more
 supported host languages.
 
 Ragel no longer parses structure and class names in order to infer machine
-names.  Parsing structures and clases requires knowledge of the host language
+names.  Parsing structures and classes requires knowledge of the host language
 hardcoded into Ragel. Since Ragel is moving towards language independence, this
 feature has been removed.
 
@@ -77,7 +77,7 @@ variables except p and pe by using the access statement.
   access some_pointer->;
   access variable_name_prefix;
 
-The writing statments are:
+The writing statements are:
 
   write data;
   write init;

doc/ragel/ragel-guide.tex

@@ -1291,7 +1291,7 @@ \subsection{Entering Action}
 through the start state then the entering action is executed. Note
 that this can happen on both a following character and on the EOF event.
 
-In some machines, the start state has transtions coming in from within the
+In some machines, the start state has transitions coming in from within the
 machine. In these cases the start state is first isolated from the rest of the
 machine ensuring that the entering actions are executed once only.
 
@@ -2723,7 +2723,7 @@ \subsection{Write Init}
 variables, they are also initialized here.
 
 The \verb|nocs| option to the write init statement will cause ragel to skip
-intialization of the cs variable. This is useful if the user wishes to use
+initialization of the cs variable. This is useful if the user wishes to use
 custom logic to decide which state the specification should start in.
 
 \subsection{Write Exec}
@@ -3018,7 +3018,7 @@ \section{Parser Modularization}
 construction operator only with considerable care. Since DFA transitions may
 actually represent several NFA transitions, a call or jump embedded in one
 machine can inadvertently terminate another machine that it shares prefixes
-with. Despite this danger, theses statements have proven useful for tying
+with. Despite this danger, these statements have proven useful for tying
 together sub-parsers of a language into a parser for the full language,
 especially for the purpose of modularizing code and reducing the number of
 states when the machine contains frequently recurring patterns.
@@ -3297,7 +3297,7 @@ \subsection{Join}
 Join a list of machines together without
 drawing any transitions, without setting up a start state, and without
 designating any final states. Transitions between the machines may be specified
-using labels and epsilon transitions. The start state must be explicity
+using labels and epsilon transitions. The start state must be explicitly
 specified with the ``start'' label. Final states may be specified with an
 epsilon transition to the implicitly created ``final'' state. The join
 operation allows one to build machines using a state chart model.

doc/ragel/ragel-guide.txt

@@ -1284,7 +1284,7 @@ means that if a machine accepts the zero-length string and control passes
 through the start state then the entering action is executed. Note
 that this can happen on both a following character and on the EOF event.
 
-In some machines, the start state has transtions coming in from within the
+In some machines, the start state has transitions coming in from within the
 machine. In these cases the start state is first isolated from the rest of the
 machine ensuring that the entering actions are executed once only.
 
@@ -2639,7 +2639,7 @@ generated code, such as call stack variables or scanner management
 variables, they are also initialized here.
 
 The `nocs` option to the write init statement will cause ragel to skip
-intialization of the cs variable. This is useful if the user wishes to use
+initialization of the cs variable. This is useful if the user wishes to use
 custom logic to decide which state the specification should start in.
 
 ==== Write Exec
@@ -2936,7 +2936,7 @@ jump statement in one of its actions should be used as an argument to a machine
 construction operator only with considerable care. Since DFA transitions may
 actually represent several NFA transitions, a call or jump embedded in one
 machine can inadvertently terminate another machine that it shares prefixes
-with. Despite this danger, theses statements have proven useful for tying
+with. Despite this danger, these statements have proven useful for tying
 together sub-parsers of a language into a parser for the full language,
 especially for the purpose of modularizing code and reducing the number of
 states when the machine contains frequently recurring patterns.
@@ -3202,7 +3202,7 @@ expr , expr , ...
 Join a list of machines together without
 drawing any transitions, without setting up a start state, and without
 designating any final states. Transitions between the machines may be specified
-using labels and epsilon transitions. The start state must be explicity
+using labels and epsilon transitions. The start state must be explicitly
 specified with the ``start'' label. Final states may be specified with an
 epsilon transition to the implicitly created ``final'' state. The join
 operation allows one to build machines using a state chart model.
@@ -3465,7 +3465,7 @@ machines, without having to compromise on the language matched, or devise some
 techniques outside of the ragel language.
 
 The NFA features require that the programmer make available `nfa_bp`, `nfa_len`
-and `nfa_count` variables. See the section <<variables_used_by_ragel, Varibles
+and `nfa_count` variables. See the section <<variables_used_by_ragel, Variables
 Used by Ragel>>
 
 Note that NFA features are non compatible with non-contiguous buffer blocks. It
@@ -3498,12 +3498,12 @@ run-time to get otherwise intractable unions to build.
 ==== NFA Repetition
 
 The NFA repetition construct `:nfa()` is designed to allow counting of objects
-in an ambiguous context. While the `:cond()` construct is an efficent counting
+in an ambiguous context. While the `:cond()` construct is an efficient counting
 method, it does not work properly when there are ambiguities around starting,
 repeating, or exiting a repetition. Since condition tests are embedding into
 transitions, they are made deterministic, therefore the repetition could be
 simultaneously incrementing and exiting the repetition. In these cases the NFA
-repetition is useful, because it will explore all possibilites and allow use
+repetition is useful, because it will explore all possibilities and allow use
 user to preserve and restore state. To pay for this, you must be willing to
 accept backtracking, however, and also give up non-congiguous buffer blocks.
 
@@ -3525,7 +3525,7 @@ backtracking it can restore relevant state, then perform the new capture.
 
 * `pop` is a condition action that restores state needed for counting instances
 of expression. This is an expression due to a current limitation of the
-implementation. In the future theis may change to a plain action.
+implementation. In the future this may change to a plain action.
 
 * `init` is an condition that is tested before entering the repeat.
 

doc/ragel/ragel.1.in

@@ -65,7 +65,7 @@ Print version information and exit.
 .TP
 .B \-o " file"
 Write output to file. If -o is not given, a default file name is chosen by
-replacing the file extenstion of the input file. For source files ending in .rh
+replacing the file extension of the input file. For source files ending in .rh
 the suffix .h is used. For all other source files a suffix based on the output
 language is used (.c, .cpp, .m, etc.). If -o is not given for Graphviz output
 the generated dot file is written to standard output.
@@ -198,7 +198,7 @@ machine control code.
 .TP
 .B --nfa-conds-depth=D
 Search for high-cost conditions inside a prefix of the machine (depth D from
-start state). Search is rooted at NFA union contructs.
+start state). Search is rooted at NFA union constructs.
 .TP
 .B --nfa-term-check
 Search for condition-based general repetitions that will not function properly
@@ -212,7 +212,7 @@ Report a fail if number states in final machine exceeds this.
 .TP
 .B --nfa-breadth-check=E1,E2,..
 Report breadth cost of named entry points by (and start). Reporting starts at
-NFA union contructs.
+NFA union constructs.
 .TP
 .B --input-histogram=FN
 Input char histogram for breadth check. If unspecified a flat histogram is
@@ -283,7 +283,7 @@ may be created with the null builtin machine.
 Makes a two state machine with one transition on the given integer number.
 .TP
 .I hex
-Makes a two state machine with one transition on the given hexidecimal number.
+Makes a two state machine with one transition on the given hexadecimal number.
 .TP
 .I "/simple_regex/"
 A simple regular expression. Supports the notation '.', '*' and '[]', character
@@ -330,7 +330,7 @@ Lowercase characters /[a-z]/.
 Uppercase characters /[A-Z]/.
 .TP
 .B xdigit
-Hexidecimal digits /[0-9A-Fa-f]/.
+Hexadecimal digits /[0-9A-Fa-f]/.
 .TP
 .B cntrl
 Control characters 0..31, 127.