代码搜索：L
找到约 10,000 项符合「L」的源代码
代码结果 10,000
www.eeworm.com/read/142661/12931577
bmp red_l.bmp
www.eeworm.com/read/142572/12939133
l wc5.l
/* Oops; slight change from wc3.l introduces backtracking */
ws [ \t]
nonws [^ \t\n]
word {ws}*{nonws}+
words {word}{ws}+
%%
int cc = 0, wc = 0, lc = 0;
{word}{ws}* cc += yyleng; ++
www.eeworm.com/read/142572/12939140
l wc4.l
/* Fastest version of wc: add rules to pick up newlines, too */
ws [ \t]
nonws [^ \t\n]
word {ws}*{nonws}+
words {word}{ws}+
%%
int cc = 0, wc = 0, lc = 0;
{word}{ws}* ++wc; cc += y
www.eeworm.com/read/142572/12939143
l wc1.l
/* First cut at a flex-based "wc" tool. */
ws [ \t]
nonws [^ \t\n]
%%
int cc = 0, wc = 0, lc = 0;
{nonws}+ cc += yyleng; ++wc;
{ws}+ cc += yyleng;
\n ++lc; ++cc;
{
www.eeworm.com/read/142572/12939147
l wc2.l
/* Somewhat faster "wc" tool: match more text with each rule */
ws [ \t]
nonws [^ \t\n]
word {ws}*{nonws}+
%%
int cc = 0, wc = 0, lc = 0;
{word}{ws}* cc += yyleng; ++wc;
{word}{ws}*\
www.eeworm.com/read/142572/12939149
l wc3.l
/* Somewhat faster still: potentially match a lot of text with each rule */
ws [ \t]
nonws [^ \t\n]
word {ws}*{nonws}+
words {word}{ws}+
%%
int cc = 0, wc = 0, lc = 0;
{word}{ws}* c
www.eeworm.com/read/142534/12941125
l ansi_c.l
D [0-9]
L [a-zA-Z_]
H [a-fA-F0-9]
E [Ee][+-]?{D}+
FS (f|F|l|L)
IS (u|U|l|L)*
%{
#include
#include "y.tab.h"
void count();
%}
%%
"/*" { comment(); }
"auto"
www.eeworm.com/read/243428/12941807
asm 10_l.asm
data_seg segment
car db 29
db 40h,0bh,0,0
db 14 dup(40h,0bh,1,0)
db 40h,00h,0,1
db 13 dup(02ah,0bh,-1,0)
;-----------------------
www.eeworm.com/read/243428/12941846
exe 10_l.exe
www.eeworm.com/read/243428/12941892