1
0
mirror of https://git.FreeBSD.org/src.git synced 2024-12-13 10:02:38 +00:00

Preprocess with tbl(1), eliminate warnings.

This commit is contained in:
Ruslan Ermilov 2002-10-24 13:21:29 +00:00
parent 74ed384d0d
commit 037509314d
Notes: svn2git 2020-12-20 02:59:44 +00:00
svn path=/head/; revision=105871
2 changed files with 5 additions and 5 deletions

View File

@ -5,4 +5,6 @@ VOLUME= psd/16.lex
SRCS= lex.ms
MACROS= -ms
USE_TBL= YES
.include <bsd.doc.mk>

View File

@ -37,6 +37,7 @@
.\" @(#)lex.ms 8.1 (Berkeley) 6/8/93
.\"
.\" $FreeBSD$
.nr tm 0
.de MH
Bell Laboratories, Murray Hill, NJ 07974.
..
@ -98,7 +99,6 @@ is performed by a deterministic finite automaton
generated by Lex.
The program fragments written by the user are executed in the order in which the
corresponding regular expressions occur in the input stream.
.if n .if \n(tm .ig
.PP
The lexical analysis
programs written with Lex accept ambiguous specifications
@ -120,7 +120,6 @@ form of Lex under UNIX Version 7.
Lex is designed to simplify
interfacing with Yacc, for those
with access to this compiler-compiler system.
..
.\".nr PS 9
.\".nr VS 11
.AE
@ -1457,7 +1456,7 @@ l l.
digram[yytext[0]][yytext[1]]++;
REJECT;
}
\. ;
\&. ;
\en ;
.TE
where the REJECT is necessary to pick up
@ -1871,7 +1870,6 @@ to find the letter
or
.I D .
The program then adds
.c
.I \(fme\(fm\-\(fmd\(fm ,
which converts
it to the next letter of the alphabet.
@ -2288,7 +2286,7 @@ Many thanks are due to both.
.PP
The code of the current version of Lex was designed, written,
and debugged by Eric Schmidt.
.SG MH-1274-MEL-unix
.if 0 .SG MH-1274-MEL-unix
.sp 1
.2C
.NH