blob: 69896c7e32b76b92a88d97a9c6ac20ad58450b18 (
plain)
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
|
// fsttopsort.cc
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Copyright 2005-2010 Google, Inc.
// Author: riley@google.com (Michael Riley)
// Modified: jpr@google.com (Jake Ratkiewicz) to use FstClass
//
// \file
// Topologically sorts an FST.
//
#include <fst/script/topsort.h>
int main(int argc, char **argv) {
namespace s = fst::script;
using fst::script::FstClass;
using fst::script::MutableFstClass;
string usage = "Topologically sorts an FST.\n\n Usage: ";
usage += argv[0];
usage += " [in.fst [out.fst]]\n";
std::set_new_handler(FailedNewHandler);
SET_FLAGS(usage.c_str(), &argc, &argv, true);
if (argc > 3) {
ShowUsage();
return 1;
}
string in_fname = argc > 1 && strcmp(argv[1], "-") != 0 ? argv[1] : "";
string out_fname = argc > 2 ? argv[2] : "";
MutableFstClass *fst = MutableFstClass::Read(in_fname, true);
if (!fst) return 1;
bool acyclic = TopSort(fst);
if (!acyclic)
LOG(WARNING) << argv[0] << ": Input FST is cyclic";
fst->Write(out_fname);
return 0;
}
|