rm references of lexer and unlexer flags from reference manual

This commit is contained in:
odanoburu
2018-04-21 20:09:40 -03:00
parent 295896190d
commit 9064c3d7cd

View File

@@ -213,9 +213,9 @@ and <CODE>lin</CODE> definitions assigning a <B>linearization</B> to each functi
concrete AdjSwe of Adj = {
lincat A = {s : AForm =&gt; Str} ;
lin Even = {s = table {
ASg Utr =&gt; "jämn" ;
ASg Neutr =&gt; "jämnt" ;
APl =&gt; "jämna"
ASg Utr =&gt; "jämn" ;
ASg Neutr =&gt; "jämnt" ;
APl =&gt; "jämna"
}
} ;
param AForm = ASg Gender | APl ;
@@ -1672,28 +1672,26 @@ Here are some flags commonly included in grammars.
<TD>concrete</TD>
</TR>
<TR>
<TD><CODE>lexer</CODE></TD>
<TD>predefined lexer</TD>
<TD>lexer before parsing</TD>
<TD>concrete</TD>
</TR>
<TR>
<TD><CODE>startcat</CODE></TD>
<TD>category</TD>
<TD>default target of parsing</TD>
<TD>abstract</TD>
</TR>
<TR>
<TD><CODE>unlexer</CODE></TD>
<TD>predefined unlexer</TD>
<TD>unlexer after linearization</TD>
<TD>concrete</TD>
</TR>
</TABLE>
<P></P>
<P>
The possible values of these flags are specified <a href="#flagvalues">here</a>.
The possible values of these flags are
specified <a href="#flagvalues">here</a>. Note that
the <code>lexer</code> and <code>unlexer</code> flags are
deprecated. If you need their functionality, you should use supply
them to GF shell commands like so:
<center><pre><code>put_string -lextext "страви, напої" | parse</code></pre></center>
A summary of their possible values can be found at the <a href="http://www.grammaticalframework.org/doc/gf-shell-reference.html">GF shell
reference</a>.
</p>
</P>
<A NAME="toc31"></A>
<H2>Types and expressions</H2>
@@ -3157,45 +3155,6 @@ are always written in UTF8 encoding. The presence of the flag
file.
</P>
<P>
The flag <CODE>lexer</CODE> in concrete syntax sets the lexer,
i.e. the processor that turns
strings into token lists sent to the parser. Some GF implementations
support the following lexers.
</P>
<TABLE ALIGN="center" CELLPADDING="4" BORDER="1">
<TR>
<TH>lexer</TH>
<TH COLSPAN="2">description</TH>
</TR>
<TR>
<TD><CODE>words</CODE></TD>
<TD>(default) tokens are separated by spaces or newlines</TD>
</TR>
<TR>
<TD><CODE>literals</CODE></TD>
<TD>like words, but integer and string literals recognized</TD>
</TR>
<TR>
<TD><CODE>chars</CODE></TD>
<TD>each character is a token</TD>
</TR>
<TR>
<TD><CODE>code</CODE></TD>
<TD>program code conventions (uses Haskell's lex)</TD>
</TR>
<TR>
<TD><CODE>text</CODE></TD>
<TD>with conventions on punctuation and capital letters</TD>
</TR>
<TR>
<TD><CODE>codelit</CODE></TD>
<TD>like code, but recognize literals (unknown words as strings)</TD>
</TR>
<TR>
<TD><CODE>textlit</CODE></TD>
<TD>like text, but recognize literals (unknown words as strings)</TD>
</TR>
</TABLE>
<P></P>
<P>
@@ -3205,41 +3164,7 @@ on category. Its legal values are the categories defined or inherited in
the abstract syntax.
</P>
<P>
The flag <CODE>unlexer</CODE> in concrete syntax sets the lexer,
i.e. the processor that turns
token lists obrained from the linearizer to strings. Some GF implementations
support the following unlexers.
</P>
<TABLE ALIGN="center" CELLPADDING="4" BORDER="1">
<TR>
<TH>unlexer</TH>
<TH COLSPAN="2">description</TH>
</TR>
<TR>
<TD><CODE>unwords</CODE></TD>
<TD>(default) space-separated token list</TD>
</TR>
<TR>
<TD><CODE>text</CODE></TD>
<TD>format as text: punctuation, capitals, paragraph &lt;p&gt;</TD>
</TR>
<TR>
<TD><CODE>code</CODE></TD>
<TD>format as code (spacing, indentation)</TD>
</TR>
<TR>
<TD><CODE>textlit</CODE></TD>
<TD>like text, but remove string literal quotes</TD>
</TR>
<TR>
<TD><CODE>codelit</CODE></TD>
<TD>like code, but remove string literal quotes</TD>
</TR>
<TR>
<TD><CODE>concat</CODE></TD>
<TD>remove all spaces</TD>
</TR>
</TABLE>
<P></P>
<A NAME="toc52"></A>