代码搜索结果
找到约 10,000 项符合
L 的代码
scan.l
%{
#include
#include "BT.h"
#include "gram.tab.h"
%}
ws [ \t]+
comment #[^\n]*
qstring \"[^\"\n]*[\"\n]
id [a-zA-Z][a-zA-Z0-9]*
nl [\r\n]
int "-"?[0-9]+
%%
{ws} ;
{comment} ;
{qstr
scan.l
%{
#include
#include "RT.h"
#include "gram.tab.h"
%}
ws [ \t]+
comment #[^\n]*
id [a-zA-Z][a-zA-Z0-9]*
nl [\r\n]
int "-"?[0-9]+
dubl "-"?[0-9]+"."[0-9]+
%%
{ws} ;
{comm
scan.l
%{
#include
#include "RT.h"
#include "gram.tab.h"
%}
ws [ \t]+
comment #[^\n]*
id [a-zA-Z][a-zA-Z0-9]*
nl [\r\n]
int "-"?[0-9]+
dubl "-"?[0-9]+"."[0-9]+
%%
{ws} ;
{comm
scan.l
%{
#include
#include "BT.h"
#include "gram.tab.h"
%}
ws [ \t]+
comment #[^\n]*
qstring \"[^\"\n]*[\"\n]
id [a-zA-Z][a-zA-Z0-9]*
nl [\r\n]
int "-"?[0-9]+
%%
{ws} ;
{comment} ;
{qstr
lex.l
%{
#include "parser.h"
#include
#include
void getline(char *buf,int *num,int max_num);
#define YY_INPUT(buf,result,max_size) {\
getline(buf,&result,max_size);\
start.l
%{
/************************************************************
start.l
This program uses start states for counting words. Instead
of matching the entire word, the program looks for a
starting l
lexer.l
%{
/****************************************************************************
lexer.l
Lexical analyser for a simple calculator. The lexical analyser is
implemented using a C++ class. This is sp
wc.l
%{
/************************************************************
wc.l
Simple word count program. main is defined in the programs
section since the one in the library calls yyparse instead.
*****
lexer.l
%{
/************************************************************
lexer.l
Lexical analyser for the multiple instance example. Note
that the lexical analyser now recognises illegal characters
on th
parser.l
%{
#include "postgres.h"
#include "deflex.h"
#include "parser.h"
#include "common.h"
/* Avoid exit() on fatal scanner errors */
#define fprintf(file, fmt, msg) ts_error(ERROR, fmt, msg)
char *toke