From: thurston <thurston@052ea7fc-9027-0410-9066-f65837a77df0>
Date: Wed, 18 Mar 2009 02:45:24 +0000 (+0000)
Subject: Merged in rlgen-java.1.in.
X-Git-Tag: 2.0_alpha~56
X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=6fe1662d06aae39010474a04085e9f6b26564aa9;p=external%2Fragel.git

Merged in rlgen-java.1.in.


git-svn-id: http://svn.complang.org/ragel/trunk@744 052ea7fc-9027-0410-9066-f65837a77df0
---

diff --git a/doc/ragel.1.in b/doc/ragel.1.in
index dc7334b..e297926 100644
--- a/doc/ragel.1.in
+++ b/doc/ragel.1.in
@@ -124,7 +124,8 @@ The host language is Ruby.
 Inhibit writing of #line directives.
 .TP
 .B \-T0
-Generate a table driven FSM. This is the default code style.  The table driven
+(all host languages) Generate a table driven FSM. This is the default code style.
+The table driven
 FSM represents the state machine as static data. There are tables of states,
 transitions, indicies and actions. The current state is stored in a variable.
 The execution is a loop that looks that given the current state and current
@@ -139,17 +140,17 @@ Generate a faster table driven FSM by expanding action lists in the action
 execute code.
 .TP
 .B \-F0
-Generate a flat table driven FSM. Transitions are represented as an array
+(C, D) Generate a flat table driven FSM. Transitions are represented as an array
 indexed by the current alphabet character. This eliminates the need for a
 binary search to locate transitions and produces faster code, however it is
 only suitable for small alphabets.
 .TP
 .B \-F1
-Generate a faster flat table driven FSM by expanding action lists in the action
+(C, D) Generate a faster flat table driven FSM by expanding action lists in the action
 execute code.
 .TP
 .B \-G0
-Generate a goto driven FSM. The goto driven FSM represents the state machine
+(C, D) Generate a goto driven FSM. The goto driven FSM represents the state machine
 as a series of goto statements. While in the machine, the current state is
 stored by the processor's instruction pointer. The execution is a flat function
 where control is passed from state to state using gotos. In general, the goto
@@ -157,15 +158,15 @@ FSM produces faster code but results in a larger binary and a more expensive
 host language compile.
 .TP
 .B \-G1
-Generate a faster goto driven FSM by expanding action lists in the action
+(C, D) Generate a faster goto driven FSM by expanding action lists in the action
 execute code.
 .TP
 .B \-G2
-Generate a really fast goto driven FSM by embedding action lists in the state
+(C, D) Generate a really fast goto driven FSM by embedding action lists in the state
 machine control code.
 .TP
 .B \-P<N>
-N-Way Split really fast goto-driven FSM.
+(C, D) N-Way Split really fast goto-driven FSM.
 
 .SH RAGEL INPUT
 NOTE: This is a very brief description of Ragel input. Ragel is described in
@@ -646,7 +647,7 @@ Save the current state and immediately break out of the machine.
 Ragel was written by Adrian Thurston <thurston@complang.org>.  Objective-C
 output contributed by Erich Ocean. D output contributed by Alan West. Ruby
 output contributed by Victor Hugo Borja. C Sharp code generation contributed by
-Daniel Tang.
+Daniel Tang. Contributions to Java code generation by Colin Fleming.
 .SH "SEE ALSO"
 .BR re2c (1),
 .BR flex (1)