File size: 3,537 Bytes
5610573 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | /* -*- mode: text -*- */
/* ====================================================================
* Copyright (c) 2007 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/* YOU MUST USE FLEX 2.6.1 OR NEWER TO PROCESS THIS FILE!!! */
%{
#include "lm/jsgf_internal.h"
#include "lm/jsgf_parser.h"
%}
%option 8bit reentrant bison-bridge noyywrap yylineno never-interactive nounput nounistd
%option header-file="jsgf_scanner.h"
%s COMMENT
%s DECL
%s DECLCOMMENT
ws [ \t\r\n]
rulename \<[^<>]+\>
tag \{(\\.|[^\}]+)*\}
weight \/[0-9]*(\.[0-9]+)?(e-)?[0-9]*\/
token [^ \t\r\n=;|*+<>()\[\]{}*/]+
qstring \"(\\.|[^"]+)*\"
bom [\xEF][\xBB][\xBF]
%%
{ws} ; /* ignore whitespace */
<INITIAL>\/\/.*\n ; /* single-line comments */
<INITIAL>\/\* { BEGIN(COMMENT); } /* C-style comments */
<COMMENT>\*\/ { BEGIN(INITIAL); }
<COMMENT>. ; /* Ignore stuff in comment mode */
<DECL>\/\/.*\n ; /* single-line comments inside decl */
<DECL>\/\* { BEGIN(DECLCOMMENT); } /* C-style comments inside decl */
<DECLCOMMENT>\*\/ { BEGIN(DECL); }
<DECLCOMMENT>. ; /* Ignore stuff in comment mode */
<INITIAL>{bom}?#JSGF {BEGIN(DECL); return HEADER;}
<INITIAL>grammar {BEGIN(DECL); return GRAMMAR;}
<INITIAL>import {BEGIN(DECL); return IMPORT;}
<INITIAL>public {BEGIN(DECL); return PUBLIC;}
<INITIAL>{rulename} { BEGIN(DECL); yylval->name = strdup(yytext); return RULENAME; }
<DECL>{rulename} { yylval->name = strdup(yytext); return RULENAME; }
<DECL>{tag} { yylval->name = strdup(yytext); return TAG; }
<DECL>{token} { yylval->name = strdup(yytext); return TOKEN; }
<DECL>; { BEGIN(INITIAL); return yytext[0]; }
<DECL>{qstring} { yylval->name = strdup(yytext); return TOKEN; }
<DECL>{weight} { yylval->weight = atof_c(yytext+1); return WEIGHT; }
<DECL>. return yytext[0]; /* Single-character tokens */
%%
|