00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */ 00002 /* ==================================================================== 00003 * Copyright (c) 2007 Carnegie Mellon University. All rights 00004 * reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 00010 * 1. Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * 00013 * 2. Redistributions in binary form must reproduce the above copyright 00014 * notice, this list of conditions and the following disclaimer in 00015 * the documentation and/or other materials provided with the 00016 * distribution. 00017 * 00018 * This work was supported in part by funding from the Defense Advanced 00019 * Research Projects Agency and the National Science Foundation of the 00020 * United States of America, and the CMU Sphinx Speech Consortium. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 00023 * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 00024 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00025 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY 00026 * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00027 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00028 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00029 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00030 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00031 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 00032 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00033 * 00034 * ==================================================================== 00035 * 00036 */ 00037 00038 #include <hash_table.h> 00039 #include <err.h> 00040 00041 #include <string.h> 00042 00043 #include "jsgf.h" 00044 00045 static int 00046 write_fsg(jsgf_t *grammar, const char *name) 00047 { 00048 jsgf_rule_iter_t *itor; 00049 00050 for (itor = jsgf_rule_iter(grammar); itor; 00051 itor = jsgf_rule_iter_next(itor)) { 00052 jsgf_rule_t *rule = jsgf_rule_iter_rule(itor); 00053 char const *rule_name = jsgf_rule_name(rule); 00054 00055 if ((name == NULL && jsgf_rule_public(rule)) 00056 || (name && strlen(rule_name)-2 == strlen(name) && 00057 0 == strncmp(rule_name + 1, name, strlen(rule_name) - 2))) { 00058 jsgf_write_fsg(grammar, rule, stdout); 00059 jsgf_rule_iter_free(itor); 00060 break; 00061 } 00062 } 00063 00064 return 0; 00065 } 00066 00067 int 00068 main(int argc, char *argv[]) 00069 { 00070 jsgf_t *jsgf; 00071 00072 jsgf = jsgf_parse_file(argc > 1 ? argv[1] : NULL, NULL); 00073 if (jsgf == NULL) { 00074 return 1; 00075 } 00076 write_fsg(jsgf, argc > 2 ? argv[2] : NULL); 00077 jsgf_grammar_free(jsgf); 00078 00079 return 0; 00080 }