lexdcompiler.cc

Bug Summary

File:	lexdcompiler.cc
Warning:	line 2185, column 6 Potential leak of memory pointed to by 'trans'
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name lexdcompiler.cc -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -pic-is-pie -mframe-pointer=all -fmath-errno -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/tmp/build/lexd/lexd-1.3.5+g175~98d02cec/src -resource-dir /usr/lib/llvm-16/lib/clang/16 -D PACKAGE_NAME="lexd" -D PACKAGE_TARNAME="lexd" -D PACKAGE_VERSION="1.3.5" -D PACKAGE_STRING="lexd 1.3.5" -D PACKAGE_BUGREPORT="awesomeevildudes@gmail.com" -D PACKAGE_URL="" -D PACKAGE="lexd" -D VERSION="1.3.5" -D HAVE_GETOPT_LONG=1 -I . -I /usr/local/include -I /usr/local/include -internal-isystem /usr/lib/llvm-16/bin/../include/c++/v1 -internal-isystem /usr/lib/llvm-16/lib/clang/16/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/14/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -std=c++2b -fdeprecated-macro -fdebug-compilation-dir=/tmp/build/lexd/lexd-1.3.5+g175~98d02cec/src -ferror-limit 19 -fgnuc-version=4.2.1 -fno-implicit-modules -fcxx-exceptions -fexceptions -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/build/lexd/scan-build/2024-09-11-161239-16607-1 -x c++ lexdcompiler.cc
1#include "lexdcompiler.h"
2#include <unicode/unistr.h>
3#include <memory>
4#include <chrono>
5#include <lttoolbox/string_utils.h>

7using namespace icu;
8using namespace std;

10bool tag_filter_t::combinable(const tag_filter_t &other) const
11{
// TODO: make ops combinable even with non-empty filters?
if(empty() || other.empty())
  return true;
return intersectset(pos(), other.neg()).empty() && intersectset(other.pos(), neg()).empty() && ops().empty() && other.ops().empty();
16}
17bool tag_filter_t::combine(const tag_filter_t &other)
18{
if(!combinable(other))
  return false;
unionset_inplace(_pos, other._pos);
unionset_inplace(_neg, other._neg);
for(const auto &op: other._ops)
  _ops.push_back(op);
return true;
26}

28void expand_alternation(vector<pattern_t> &pats, const vector<pattern_element_t> &alternation);
29vector<pattern_element_t> distribute_tag_expressions(const pattern_element_t &token)
30{
vector<pattern_element_t> result;
for(const auto &f: token.tag_filter.distribute())
{
  pattern_element_t new_token = token;
  new_token.tag_filter = f;
  result.push_back(new_token);
}
return result;
39}

41bool tag_filter_t::compatible(const tags_t &tags) const
42{
return subset(pos(), tags) && intersectset(neg(), tags).empty() && ops().empty();
44}
45bool tag_filter_t::applicable(const tags_t &tags) const
46{
return subset(neg(), tags) && ops().empty();
48}
49bool tag_filter_t::try_apply(tags_t &tags) const
50{
if(!applicable(tags))
  return false;
subtractset_inplace(tags, neg());
unionset_inplace(tags, pos());
return true;
56}
57bool pattern_element_t::compatible(const lex_seg_t &tok) const
58{
return left.name.empty() || right.name.empty() || tag_filter.compatible(tok.tags);
60}
61const UnicodeString &LexdCompiler::name(string_ref r) const
62{
return id_to_name[(unsigned int)r];
64}

66UnicodeString LexdCompiler::printPattern(const pattern_element_t& pat)
67{
UnicodeString ret = name(pat.left.name);
auto& pos = pat.tag_filter.pos();
auto& neg = pat.tag_filter.neg();
if (!pos.empty() || !neg.empty()) {
  ret += '[';
  int ln = ret.length();
  for (auto& it : pos) {
    if (ret.length() > ln) ret += ',';
    ret += name(it);
  }
  for (auto& it : neg) {
    if (ret.length() > ln) ret += ',';
    ret += '-';
    ret += name(it);
  }
  ret += ']';
}
switch (pat.mode) {
case Question:
  ret += '?'; break;
case Plus:
  ret += '+'; break;
case Star:
  ret += '*'; break;
default: break;
}
return ret;
95}

97UnicodeString LexdCompiler::printFilter(const tag_filter_t& filter)
98{
UnicodeString ret;
ret += '[';
for (auto& it : filter.pos()) {
  if (ret.length() > 1) ret += ',';
  ret += name(it);
}
for (auto& it : filter.neg()) {
  if (ret.length() > 1) ret += ',';
  ret += '-';
  ret += name(it);
}
for (auto& op : filter.ops()) {
  if (ret.length() > 1) ret += ',';
  ret += op->sigil;
  ret += '[';
  int ln = ret.length();
  for (auto& it : *op) {
    if (ret.length() > ln) ret += ',';
    ret += name(it);
  }
  ret += ']';
}
ret += ']';
return ret;
123}

125trans_sym_t LexdCompiler::alphabet_lookup(const UnicodeString &symbol)
126{
if (!symbol.hasMoreChar32Than(0, symbol.length(), 1)) {
  return trans_sym_t((int)symbol.char32At(0));
} else {
  UString temp;
  temp.append(symbol.getBuffer(), (unsigned int)symbol.length());
  alphabet.includeSymbol(temp);
  return trans_sym_t(alphabet(temp));
}
135}
136trans_sym_t LexdCompiler::alphabet_lookup(trans_sym_t l, trans_sym_t r)
137{
return trans_sym_t(alphabet((int)l, (int)r));
139}

141LexdCompiler::LexdCompiler()
142{
id_to_name.push_back("");
name_to_id[""] = string_ref(0);
lexicons[string_ref(0)] = vector<entry_t>();

left_sieve_name = internName("<");
token_t lsieve_tok = {.name=left_sieve_name, .part=1, .optional=false};
pattern_element_t lsieve_elem = {.left=lsieve_tok, .right=lsieve_tok,
                                 .tag_filter=tag_filter_t(),
                                 .mode=Normal};
left_sieve_tok = vector<pattern_element_t>(1, lsieve_elem);

right_sieve_name = internName(">");
token_t rsieve_tok = {.name=right_sieve_name, .part=1, .optional=false};
pattern_element_t rsieve_elem = {.left=rsieve_tok, .right=rsieve_tok,
                                 .tag_filter=tag_filter_t(),
                                 .mode=Normal};
right_sieve_tok = vector<pattern_element_t>(1, rsieve_elem);
160}

162LexdCompiler::~LexdCompiler()
163{}

165// u_*printf only accept const UChar*
166// so here's a wrapper so we don't have to write all this out every time
167// and make it a macro so we don't have issues with it deallocating
168#define err(s)(to_ustring(s).c_str()) (to_ustring(s).c_str())

170void
171LexdCompiler::die(const char* msg, ...)
172{
UFILE* err_out = u_finitu_finit_72(stderrstderr, NULL__null, NULL__null);
u_fprintfu_fprintf_72(err_out, "Error on line %d: ", lineNumber);
va_list argptr;
va_start(argptr, msg)__builtin_va_start(argptr, msg);
u_vfprintfu_vfprintf_72(err_out, msg, argptr);
va_end(argptr)__builtin_va_end(argptr);
u_fputcu_fputc_72('\n', err_out);
exit(EXIT_FAILURE1);
181}

183void LexdCompiler::appendLexicon(string_ref lexicon_id, const vector<entry_t> &to_append)
184{
if(lexicons.find(lexicon_id) == lexicons.end())
  lexicons[lexicon_id] = to_append;
else
  lexicons[lexicon_id].insert(lexicons[lexicon_id].begin(), to_append.begin(), to_append.end());
189}

191void
192LexdCompiler::finishLexicon()
193{
if(inLex)
{
  if (currentLexicon.size() == 0) {
    die("Lexicon '%S' is empty.", err(name(currentLexiconId))(to_ustring(name(currentLexiconId)).c_str()));
  }
  appendLexicon(currentLexiconId, currentLexicon);

  currentLexicon.clear();
  currentLexicon_tags.clear();
}
inLex = false;
205}

207string_ref
208LexdCompiler::internName(const UnicodeString& name)
209{
if(name_to_id.find(name) == name_to_id.end())
{
  name_to_id[name] = string_ref(id_to_name.size());
  id_to_name.push_back(name);
}
return name_to_id[name];
216}

218string_ref
219LexdCompiler::checkName(UnicodeString& name)
220{
const static UString forbidden = u" :?|()<>[]*+";
name.trim();
int l = name.length();
if(l == 0) die("Unnamed pattern or lexicon.");

for(const auto &c: forbidden) {
  if(name.indexOf(c) != -1) {
    die("Lexicon/pattern names cannot contain character '%C'", c);
  }
}
return internName(name);
232}

234tags_t
235LexdCompiler::readTags(char_iter &iter, UnicodeString &line)
236{
tag_filter_t filter = readTagFilter(iter, line);
if(filter.neg().empty() && filter.ops().empty())
  return tags_t((set<string_ref>)filter.pos());
else
   die("Cannot declare negative tag in lexicon");
return tags_t();
243}

245tag_filter_t
246LexdCompiler::readTagFilter(char_iter& iter, UnicodeString& line)
247{
tag_filter_t tag_filter;
auto tag_start = (++iter).span();
bool tag_nonempty = false;
bool negative = false;
vector<shared_ptr<op_tag_filter_t>> ops;
for(; !iter.at_end() && (*iter).length() > 0; ++iter)
{
  if(*iter == "]" || *iter == "," || *iter == " ")
  {
    if(!tag_nonempty)
      die("Empty tag at char %d", + iter.span().first);
    UnicodeString s = line.tempSubStringBetween(tag_start.first, iter.span().first);
    if(!tag_filter.combine(
      negative ? tag_filter_t(neg_tag_filter_t {checkName(s)})
               : tag_filter_t(pos_tag_filter_t {checkName(s)})
    ))
      die("Illegal tag filter.");
    tag_nonempty = false;
    negative = false;
    if(*iter == "]")
    {
      iter++;
      return tag_filter_t(tag_filter.pos(), tag_filter.neg(), ops);
    }
  }
  else if(!tag_nonempty && *iter == "-")
  {
    negative = true;
  }
  else if(!tag_nonempty && (*iter == "|" || *iter == "^"))
  {
    const UnicodeString s = *iter;
    if(negative)
      die("Illegal negated operation.");
    *iter++;
    if (*iter == "[")
    {
      shared_ptr<op_tag_filter_t> op;
      tags_t operands = readTags(iter, line);
      if (s == "|")
        op = make_shared<or_tag_filter_t>(operands);
      else if (s == "^")
        op = make_shared<xor_tag_filter_t>(operands);
      ops.push_back(op);
    }
    else
      die("Expected list of operands.");
    if(*iter == "]")
    {
      iter++;
      return tag_filter_t(tag_filter.pos(), tag_filter.neg(), ops);
    }
  }
  else if(!tag_nonempty)
  {
    tag_nonempty = true;
    tag_start = iter.span();
  }
}
die("End of line in tag list, expected ']'");
return tag_filter_t();
309}

311void
312LexdCompiler::appendSymbol(const UnicodeString& s, lex_token_t& tok)
313{
if (shouldCombine) {
  tok.symbols.push_back(alphabet_lookup(s));
} else {
  for (int c = 0; c < s.length(); c++) {
    tok.symbols.push_back(alphabet_lookup(s[c]));
  }
}
321}

323void
324LexdCompiler::readSymbol(char_iter& iter, UnicodeString& line, lex_token_t& tok)
325{
if ((*iter).startsWith("\\")) {
  if ((*iter).length() == 1) {
    appendSymbol(*++iter, tok);
  } else {
    appendSymbol((*iter).tempSubString(1), tok);
  }
} else if ((*iter).startsWith(":")) {
  appendSymbol((*iter).tempSubString(1), tok);
} else if (*iter == "{" || *iter == "<") {
  UChar end = (*iter == "{") ? '}' : '>';
  int i = iter.span().first;
  for (; !iter.at_end() && *iter != end; ++iter) ;

  if (*iter == end) {
    tok.symbols.push_back(alphabet_lookup(line.tempSubStringBetween(i, iter.span().second)));
  } else {
    die("Multichar symbol didn't end; searching for %S", err(end)(to_ustring(end).c_str()));
  }
} else {
  appendSymbol(*iter, tok);
}
347}

349int
350LexdCompiler::processRegexTokenSeq(char_iter& iter, UnicodeString& line, Transducer* trans, int start_state)
351{
bool inleft = true;
vector<vector<lex_token_t>> left, right;
for (; !iter.at_end(); ++iter) {
  if (*iter == "(" || *iter == ")" || *iter == "|" || *iter == "/") break;
  else if (*iter == "?" || *iter == "*" || *iter == "+")
    die("Quantifier %S may only be applied to parenthesized groups", err(*iter)(to_ustring(*iter).c_str()));
  else if (*iter == "]") die("Regex contains mismatched ]");
  else if (*iter == ":" && inleft) inleft = false;
  else if (*iter == ":") die("Regex contains multiple colons");
  else if (*iter == "[") {
    ++iter;
    vector<lex_token_t> sym;
    for (; !iter.at_end(); ++iter) {
      if (*iter == "]") break;
      else if (*iter == "-" && !sym.empty()) {
        ++iter;
        if (*iter == "]" || iter.at_end()) {
          --iter;
          lex_token_t temp;
          readSymbol(iter, line, temp);
          sym.push_back(temp);
        } else {
          lex_token_t start = sym.back();
          lex_token_t end;
          readSymbol(iter, line, end);
          // This will fail on diacritics even with -U
          // on the principle that command-line args should not
          // change the validity of the code -DGS 2022-05-17
          if (start.symbols.size() != 1 || end.symbols.size() != 1 ||
              (int)start.symbols[0] <= 0 || (int)end.symbols[0] <= 0)
            die("Cannot process symbol range between multichar symbols");
          int i_start = (int)start.symbols[0];
          int i_end = (int)end.symbols[0];
          if (i_start > i_end)
            die("First character in symbol range does not preceed last");
          for (int i = 1 + i_start; i <= i_end; i++) {
            lex_token_t mid;
            mid.symbols.push_back((trans_sym_t)i);
            sym.push_back(mid);
          }
        }
      } else {
        lex_token_t temp;
        readSymbol(iter, line, temp);
        sym.push_back(temp);
      }
    }
    (inleft ? left : right).push_back(sym);
  } else {
    vector<lex_token_t> v_temp;
    lex_token_t t_temp;
    readSymbol(iter, line, t_temp);
    v_temp.push_back(t_temp);
    (inleft ? left : right).push_back(v_temp);
  }
}
int state = start_state;
vector<lex_token_t> empty_vec;
lex_token_t empty_tok;
empty_tok.symbols.push_back(trans_sym_t());
empty_vec.push_back(empty_tok);
for (unsigned int i = 0; i < left.size() || i < right.size(); i++) {
  vector<lex_token_t>& lv = (i < left.size() && !left[i].empty() ?
                             left[i] : empty_vec);
  vector<lex_token_t>& rv = (i < right.size() && !right[i].empty() ?
                             right[i] : empty_vec);
  bool first = true;
  int dest_state = 0;
  if (inleft) {
    for (auto& s : lv) {
      if (first) {
        dest_state = state;
        for (auto& it : s.symbols)
          dest_state = trans->insertNewSingleTransduction(alphabet((int)it, (int)it), dest_state);
        if (dest_state == state)
          dest_state = trans->insertNewSingleTransduction(0, dest_state);
        first = false;
      } else if (s.symbols.empty()) {
        trans->linkStates(state, dest_state, 0);
      } else {
        int cur_state = state;
        for (unsigned int k = 0; k < s.symbols.size(); k++) {
          if (k+1 == s.symbols.size())
            trans->linkStates(cur_state, dest_state, alphabet((int)s.symbols[k], (int)s.symbols[k]));
          else
            cur_state = trans->insertNewSingleTransduction(alphabet((int)s.symbols[k], (int)s.symbols[k]), cur_state);
        }
      }
    }
  } else {
    for (auto& l : lv) {
      for (auto& r : rv) {
        vector<int> paired;
        for (unsigned int j = 0; j < l.symbols.size() || j < r.symbols.size(); j++) {
          trans_sym_t ls = (j < l.symbols.size() ? l.symbols[j] : trans_sym_t());
          trans_sym_t rs = (j < r.symbols.size() ? r.symbols[j] : trans_sym_t());
          paired.push_back(alphabet((int)ls, (int)rs));
        }
        if (first) {
          dest_state = state;
          for (auto& it : paired) {
            dest_state = trans->insertNewSingleTransduction(it, dest_state);
          }
          first = false;
        } else {
          int cur_state = state;
          for (unsigned int k = 0; k < paired.size(); k++) {
            if (k+1 == paired.size())
              trans->linkStates(cur_state, dest_state, paired[k]);
            else
              cur_state = trans->insertNewSingleTransduction(paired[k], cur_state);
          }
        }
      }
    }
  }
  state = dest_state;
}
return state;
471}

473int
474LexdCompiler::processRegexGroup(char_iter& iter, UnicodeString& line, Transducer* trans, int start_state, unsigned int depth)
475{
++iter; // initial slash or paren
int state = start_state;
vector<int> option_ends;
for (; !iter.at_end(); ++iter) {
  if (*iter == "(") {
    state = trans->insertNewSingleTransduction(0, state);
    state = processRegexGroup(iter, line, trans, state, depth+1);
    --iter;
    // this function ends on character after close paren or quantifier
    // so step back so loop increment doesn't skip a character
  }
  else if (*iter == ")" || *iter == "/") break;
  else if (*iter == "|") {
    if (state == start_state)
      state = trans->insertNewSingleTransduction(0, state);
    option_ends.push_back(state);
    state = start_state;
  }
  else {
    state = processRegexTokenSeq(iter, line, trans, state);
    --iter;
  }
}
if (state == start_state)
  state = trans->insertNewSingleTransduction(0, state);
for (auto& it : option_ends)
  trans->linkStates(it, state, 0);
if ((depth > 0 && *iter == "/") || (depth == 0 && *iter == ")"))
  die("Mismatched parentheses in regex");
if (iter.at_end())
  die("Unterminated regex");
++iter;
if (depth > 0) {
  if (*iter == "?") {
    trans->linkStates(start_state, state, 0);
    ++iter;
  } else if (*iter == "*") {
    trans->linkStates(start_state, state, 0);
    trans->linkStates(state, start_state, 0);
    ++iter;
  } else if (*iter == "+") {
    trans->linkStates(state, start_state, 0);
    ++iter;
  }
}
return state;
522}

524lex_seg_t
525LexdCompiler::processLexiconSegment(char_iter& iter, UnicodeString& line, unsigned int part_count)
526{
lex_seg_t seg;
bool inleft = true;
bool left_tags_applied = false, right_tags_applied = false;
tag_filter_t tags;
if((*iter).startsWith(" "))
{
  if((*iter).length() > 1)
  {
    // if it's a space with a combining diacritic after it,
    // then we want the diacritic
    UnicodeString cur = *iter;
    cur.retainBetween(1, cur.length());
    seg.left.symbols.push_back(alphabet_lookup(cur));
  }
  ++iter;
}
if((*iter).startsWith("/") && seg.left.symbols.size() == 0)
{
  seg.regex = new Transducer();
  int state = processRegexGroup(iter, line, seg.regex, 0, 0);
  seg.regex->setFinal(state);
}
if(iter.at_end() && seg.regex == nullptr && seg.left.symbols.size() == 0)
  die("Expected %d parts, found %d", currentLexiconPartCount, part_count);
for(; !iter.at_end(); ++iter)
{
  if((*iter).startsWith(" ") || *iter == ']')
    break;
  else if(*iter == "[")
  {
    auto &tags_applied = inleft ? left_tags_applied : right_tags_applied;
    if(tags_applied)
      die("Already provided tag list for this side.");
    tags = readTagFilter(iter, line);
    --iter;
    tags_applied = true;
  }
  else if((*iter).startsWith(":"))
  {
    if(inleft)
      inleft = false;
    else
      die("Lexicon entry contains multiple colons");
    if ((*iter).length() > 1) readSymbol(iter, line, seg.right);
  }
  else readSymbol(iter, line, (inleft ? seg.left : seg.right));
}
if(inleft)
{
  seg.right = seg.left;
}

if (seg.regex != nullptr &&
    !(seg.left.symbols.empty() && seg.right.symbols.empty()))
  die("Lexicon entry contains both regex and text");

seg.tags = currentLexicon_tags;

if(!tags.try_apply(seg.tags))
{
  tags_t diff = subtractset(tags.neg(), seg.tags);
  for(string_ref t: diff)
    cerr << "Bad tag '-" << to_ustring(name(t)) << "'" << endl;
  die("Negative tag has no default to unset.");
}

return seg;
594}

596token_t
597LexdCompiler::readToken(char_iter& iter, UnicodeString& line)
598{
auto begin_charspan = iter.span();

const UnicodeString boundary = " :()[]+*?|<>";

for(; !iter.at_end() && boundary.indexOf(*iter) == -1; ++iter);
UnicodeString name;
line.extract(begin_charspan.first, (iter.at_end() ? line.length() : iter.span().first) - begin_charspan.first, name);

if(name.length() == 0)
  die("Symbol '%S' without lexicon name at u16 %d-%d", err(*iter)(to_ustring(*iter).c_str()), iter.span().first, iter.span().second-1);

bool optional = false;
if(*iter == "?") {
  iter++;
  if(*iter == "(") {
    optional = true;
  } else {
    iter--;
  }
}

unsigned int part = 1;
if(*iter == "(")
{
  iter++;
  begin_charspan = iter.span();
  for(; !iter.at_end() && (*iter).length() > 0 && *iter != ")"; iter++)
  {
    if((*iter).length() != 1 || !u_isdigitu_isdigit_72((*iter).charAt(0)))
      die("Syntax error - non-numeric index in parentheses: %S", err(*iter)(to_ustring(*iter).c_str()));
  }
  if(*iter != ")")
    die("Syntax error - unmatched parenthesis");
  if(iter.span().first == begin_charspan.first)
    die("Syntax error - missing index in parenthesis");
  part = (unsigned int)StringUtils::stoi(to_ustring(line.tempSubStringBetween(begin_charspan.first, iter.span().first)));
  if (part == 0) die("Invalid column number (0)");
  ++iter;
}

return token_t {.name = internName(name), .part = part, .optional = optional};
640}

642RepeatMode
643LexdCompiler::readModifier(char_iter& iter)
644{
if(*iter == "?")
{
  ++iter;
  return Question;
}
else if(*iter == "*")
{
  ++iter;
  return Star;
}
else if(*iter == "+")
{
  ++iter;
  return Plus;
}
return Normal;
661}

663pattern_element_t
664LexdCompiler::readPatternElement(char_iter& iter, UnicodeString& line)
665{
const UnicodeString boundary = " :()[]+*?|<>";
pattern_element_t tok;
if(*iter == ":")
{
  iter++;
  if(boundary.indexOf(*iter) != -1)
  {
    if(*iter == ":")
      die("Syntax error - double colon");
    else
      die("Colon without lexicon or pattern name");
  }
  tok.right = readToken(iter, line);
}
else if(boundary.indexOf(*iter) != -1)
{
  die("Unexpected symbol '%S' at column %d", err(*iter)(to_ustring(*iter).c_str()), iter.span().first);
}
else
{
  tok.left = readToken(iter, line);
  if(*iter == "[")
  {
    tok.tag_filter.combine(readTagFilter(iter, line));
  }
  if(*iter == ":")
  {
    iter++;
    if(!iter.at_end() && (*iter).length() > 0)
    {
      if(boundary.indexOf(*iter) == -1)
      {
        tok.right = readToken(iter, line);
      }
    }
  }
  else
  {
    tok.right = tok.left;
  }
}
if(*iter == "[")
{
  tok.tag_filter.combine(readTagFilter(iter, line));
}
tok.mode = readModifier(iter);

return tok;
714}

716void
717LexdCompiler::processPattern(char_iter& iter, UnicodeString& line)
718{
vector<pattern_t> pats_cur(1);
vector<pattern_element_t> alternation;
bool final_alternative = true;
bool sieve_forward = false;
bool just_sieved = false;
const UnicodeString boundary = " :()[]+*?|<>";
const UnicodeString token_boundary = " )|<>";
const UnicodeString token_side_boundary = token_boundary + ":+*?";
const UnicodeString token_side_name_boundary = token_side_boundary + "([]";
const UnicodeString modifier = "+*?";
const UnicodeString decrement_after_token = token_boundary + "([]";

for(; !iter.at_end() && *iter != ')' && (*iter).length() > 0; ++iter)
{
  if(*iter == " ") ;
  else if(*iter == "|")
  {
    if(alternation.empty())
      die("Syntax error - initial |");
    if(!final_alternative)
      die("Syntax error - multiple consecutive |");
    if(just_sieved)
      die("Syntax error - sieve and alternation operators without intervening token");
    final_alternative = false;
  }
  else if(*iter == "<")
  {
    if(sieve_forward)
      die("Syntax error - cannot sieve backwards after forwards.");
    if(alternation.empty())
      die("Backward sieve without token?");
    if(just_sieved)
      die("Syntax error - multiple consecutive sieve operators");
    if(!final_alternative)
      die("Syntax error - alternation and sieve operators without intervening token");
    expand_alternation(pats_cur, alternation);
    expand_alternation(pats_cur, left_sieve_tok);
    alternation.clear();
    just_sieved = true;
  }
  else if(*iter == ">")
  {
    sieve_forward = true;
    if(alternation.empty())
      die("Forward sieve without token?");
    if(just_sieved)
      die("Syntax error - multiple consecutive sieve operators");
    if(!final_alternative)
      die("Syntax error - alternation and sieve operators without intervening token");
    expand_alternation(pats_cur, alternation);
    expand_alternation(pats_cur, right_sieve_tok);
    alternation.clear();
    just_sieved = true;
  }
  else if(*iter == "[")
  {
    UnicodeString name = UnicodeString::fromUTF8(" " + to_string(anonymousCount++));
    currentLexiconId = internName(name);
    currentLexiconPartCount = 1;
    inLex = true;
    entry_t entry;
    entry.push_back(processLexiconSegment(++iter, line, 0));
    if(*iter == " ") iter++;
    if(*iter != "]")
      die("Missing closing ] for anonymous lexicon");
    currentLexicon.push_back(entry);
    finishLexicon();
    if(final_alternative && !alternation.empty())
    {
      expand_alternation(pats_cur, alternation);
      alternation.clear();
    }
    ++iter;
    pattern_element_t anon;
    anon.left = {.name=currentLexiconId, .part=1, .optional=false};
    anon.right = anon.left;
    anon.mode = readModifier(iter);
    alternation.push_back(anon);
    --iter;
    final_alternative = true;
    just_sieved = false;
  }
  else if(*iter == "(")
  {
    string_ref temp = currentPatternId;
    UnicodeString name = UnicodeString::fromUTF8(" " + to_string(anonymousCount++));
    currentPatternId = internName(name);
    ++iter;
    processPattern(iter, line);
    if(*iter == " ")
      *iter++;
    if(iter.at_end() || *iter != ")")
      die("Missing closing ) for anonymous pattern");
    ++iter;
    tag_filter_t filter;
    if(*iter == "[")
      filter = readTagFilter(iter, line);
    if(final_alternative && !alternation.empty())
    {
      expand_alternation(pats_cur, alternation);
      alternation.clear();
    }
    pattern_element_t anon;
    anon.left = {.name=currentPatternId, .part=1, .optional=false};
    anon.right = anon.left;
    anon.mode = readModifier(iter);
    anon.tag_filter = filter;
    for(const auto &tok : distribute_tag_expressions(anon))
      alternation.push_back(tok);
    --iter;
    currentPatternId = temp;
    final_alternative = true;
    just_sieved = false;
  }
  else if(*iter == "?" || *iter == "*" || *iter == "+")
  {
    die("Syntax error - unexpected modifier at u16 %d-%d", iter.span().first, iter.span().second);
  }
  else
  {
    if(final_alternative && !alternation.empty())
    {
      expand_alternation(pats_cur, alternation);
      alternation.clear();
    }
    for(const auto &tok : distribute_tag_expressions(readPatternElement(iter, line)))
      alternation.push_back(tok);
    iter--;
    final_alternative = true;
    just_sieved = false;
  }
}
if(!final_alternative)
  die("Syntax error - trailing |");
if(just_sieved)
  die("Syntax error - trailing sieve (< or >)");
expand_alternation(pats_cur, alternation);
for(const auto &pat : pats_cur)
{
  patterns[currentPatternId].push_back(make_pair(lineNumber, pat));
}
860}

862void
863LexdCompiler::processNextLine()
864{
UnicodeString line;
UChar c;
bool escape = false;
bool comment = false;
bool lastWasSpace = false;
while((c = u_fgetcu_fgetc_72(input)) != '\n')
{
  bool space = false;
  if(c == U_EOF0xFFFF)
  {
    doneReading = true;
    break;
  }
  if(comment) continue;
  if(escape)
  {
    line += c;
    escape = false;
  }
  else if(c == '\\')
  {
    escape = true;
    line += c;
  }
  else if(c == '#')
  {
    comment = true;
  }
  else if(u_isWhitespaceu_isWhitespace_72(c))
  {
    if(line.length() > 0 && !lastWasSpace)
    {
      line += ' ';
    }
    space = (line.length() > 0);
  }
  else line += c;
  lastWasSpace = space;
}
lineNumber++;
if(escape) die("Trailing backslash");
if(line.length() == 0) return;

if(line == "PATTERNS" || line == "PATTERNS ")
{
  finishLexicon();
  UnicodeString name = " ";
  currentPatternId = internName(name);
  inPat = true;
}
else if(line.length() > 7 && line.startsWith("PATTERN "))
{
  UnicodeString name = line.tempSubString(8);
  finishLexicon();
  currentPatternId = checkName(name);
  if (lexicons.find(currentPatternId) != lexicons.end()) {
    die("The name '%S' cannot be used for both LEXICONs and PATTERNs.",
        err(name)(to_ustring(name).c_str()));
  }
  inPat = true;
}
else if(line.length() > 7 && line.startsWith("LEXICON "))
{
  UnicodeString name = line.tempSubString(8);
  name.trim();
  finishLexicon();
  if(name.length() > 1 && name.indexOf('[') != -1)
  {
    UnicodeString tags = name.tempSubString(name.indexOf('['));
    auto c = char_iter(tags);
    currentLexicon_tags = readTags(c, tags);
    if(c != c.end() && *c == ":")
    {
      cerr << "WARNING: One-sided tags are deprecated and will soon be removed (line " << lineNumber << ")" << endl;
      ++c;
      if(*c == "[")
        unionset_inplace(currentLexicon_tags, readTags(c, tags));
else
        die("Expected start of default right tags '[' after ':'.");
    }
    if(c != c.end())
      die("Unexpected character '%C' after default tags.", (*c)[0]);
    name.retainBetween(0, name.indexOf('['));
  }
  currentLexiconPartCount = 1;
  if(name.length() > 1 && name.endsWith(')'))
  {
    UnicodeString num;
    for(int i = name.length()-2; i > 0; i--)
    {
      if(u_isdigitu_isdigit_72(name[i])) num = name[i] + num;
      else if(name[i] == '(' && num.length() > 0)
      {
        currentLexiconPartCount = (unsigned int)StringUtils::stoi(to_ustring(num));
        name = name.retainBetween(0, i);
      }
      else break;
    }
    if(name.length() == 0) die("Unnamed lexicon");
  }
  currentLexiconId = checkName(name);
  if(lexicons.find(currentLexiconId) != lexicons.end()) {
    if(lexicons[currentLexiconId][0].size() != currentLexiconPartCount) {
      die("Multiple incompatible definitions for lexicon '%S'.", err(name)(to_ustring(name).c_str()));
    }
  }
  if (patterns.find(currentLexiconId) != patterns.end()) {
    die("The name '%S' cannot be used for both LEXICONs and PATTERNs.",
        err(name)(to_ustring(name).c_str()));
  }
  inLex = true;
  inPat = false;
}
else if(line.length() >= 9 && line.startsWith("ALIAS "))
{
  finishLexicon();
  if(line.endsWith(' ')) line.retainBetween(0, line.length()-1);
  int loc = line.indexOf(" ", 6);
  if(loc == -1) die("Expected 'ALIAS lexicon alt_name'");
  UnicodeString name = line.tempSubString(6, loc-6);
  UnicodeString alt = line.tempSubString(loc+1);
  string_ref altid = checkName(alt);
  string_ref lexid = checkName(name);
  if(lexicons.find(lexid) == lexicons.end()) die("Attempt to alias undefined lexicon '%S'.", err(name)(to_ustring(name).c_str()));
  lexicons[altid] = lexicons[lexid];
  inLex = false;
  inPat = false;
}
else if(inPat)
{
  char_iter iter = char_iter(line);
  processPattern(iter, line);
  if(!iter.at_end() && (*iter).length() > 0)
    die("Unexpected %S", err(*iter)(to_ustring(*iter).c_str()));
}
else if(inLex)
{
  char_iter iter = char_iter(line);
  entry_t entry;
  for(unsigned int i = 0; i < currentLexiconPartCount; i++)
  {
    entry.push_back(processLexiconSegment(iter, line, i));
    if (*iter == "]") die("Unexpected closing bracket.");
  }
  if(*iter == ' ') ++iter;
  if(!iter.at_end())
    die("Lexicon entry has '%S' (found at u16 %d), more than %d components", err(*iter)(to_ustring(*iter).c_str()), iter.span().first, currentLexiconPartCount);
  currentLexicon.push_back(entry);
}
else die("Expected 'PATTERNS' or 'LEXICON'");
1015}

1017bool
1018LexdCompiler::isLexiconToken(const pattern_element_t& tok)
1019{
const bool llex = (tok.left.name.empty() || (lexicons.find(tok.left.name) != lexicons.end()));
const bool rlex = (tok.right.name.empty() || (lexicons.find(tok.right.name) != lexicons.end()));
if(llex && rlex)
{
  return true;
}
const bool lpat = (patterns.find(tok.left.name) != patterns.end());
const bool rpat = (patterns.find(tok.right.name) != patterns.end());
if(tok.left.name == tok.right.name && lpat && rpat)
{
  if(tok.left.part != 1 || tok.right.part != 1)
  {
    die("Cannote select part of pattern %S", err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
  }
  return false;
}
// Any other scenario is an error, so we need to die()
if(lpat && rpat)
{
  die("Cannot collate pattern %S with %S", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
}
else if((lpat && tok.right.name.empty()) || (rpat && tok.left.name.empty()))
{
  die("Cannot select side of pattern %S", err(name(tok.left.name.valid() ? tok.left.name : tok.right.name))(to_ustring(name(tok.left.name.valid() ? tok.left.name : tok.
right.name)).c_str()));
}
else if(llex && rpat)
{
  die("Cannot collate lexicon %S with pattern %S", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
}
else if(lpat && rlex)
{
  die("Cannot collate pattern %S with lexicon %S", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
}
else
{
  cerr << "Patterns: ";
  for(auto pat: patterns)
    cerr << to_ustring(name(pat.first)) << " ";
  cerr << endl;
  cerr << "Lexicons: ";
  for(auto l: lexicons)
    cerr << to_ustring(name(l.first)) << " ";
  cerr << endl;
  die("Lexicon or pattern '%S' is not defined.", err(name((llex || lpat) ? tok.right.name : tok.left.name))(to_ustring(name((llex || lpat) ? tok.right.name : tok.left.name
)).c_str()));
}
// we never reach this point, but the compiler doesn't understand die()
// so we put a fake return value to keep it happy
return false;
1068}

1070void
1071LexdCompiler::buildPattern(int state, Transducer* t, const pattern_t& pat, const vector<int> is_free, unsigned int pos)
1072{
if(pos == pat.size())
{
  t->setFinal(state);
  return;
}
const pattern_element_t& tok = pat[pos];
if(tok.left.name == left_sieve_name)
{
  t->linkStates(t->getInitial(), state, 0);
  buildPattern(state, t, pat, is_free, pos+1);
}
else if(tok.left.name == right_sieve_name)
{
  t->setFinal(state);
  buildPattern(state, t, pat, is_free, pos+1);
}
else if(isLexiconToken(tok))
{
  if(is_free[pos] == 1)
  {
    Transducer *lex = getLexiconTransducer(pat[pos], 0, true);
    if(lex)
    {
      int new_state = t->insertTransducer(state, *lex);
      buildPattern(new_state, t, pat, is_free, pos+1);
    }
    return;
  }
  else if(matchedParts.find(tok.left.name) == matchedParts.end() &&
          matchedParts.find(tok.right.name) == matchedParts.end())
  {
    unsigned int max = lexicons[tok.left.name || tok.right.name].size();
    if (tok.optional()) max++;
    for(unsigned int index = 0; index < max; index++)
    {
      Transducer *lex = getLexiconTransducer(pat[pos], index, false);
      if(lex)
      {
        int new_state = t->insertTransducer(state, *lex);
        if(new_state == state)
        {
          new_state = t->insertNewSingleTransduction(0, state);
        }
        if(tok.left.name.valid()) matchedParts[tok.left.name] = index;
        if(tok.right.name.valid()) matchedParts[tok.right.name] = index;
        buildPattern(new_state, t, pat, is_free, pos+1);
      }
    }
    if(tok.left.name.valid()) matchedParts.erase(tok.left.name);
    if(tok.right.name.valid()) matchedParts.erase(tok.right.name);
    return;
  }
  if(tok.left.name.valid() && matchedParts.find(tok.left.name) == matchedParts.end())
    matchedParts[tok.left.name] = matchedParts[tok.right.name];
  if(tok.right.name.valid() && matchedParts.find(tok.right.name) == matchedParts.end())
    matchedParts[tok.right.name] = matchedParts[tok.left.name];
  if(tok.left.name.valid() && tok.right.name.valid() && matchedParts[tok.left.name] != matchedParts[tok.right.name])
    die("Cannot collate %S with %S - both appear in free variation earlier in the pattern.", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
  Transducer* lex = getLexiconTransducer(pat[pos], matchedParts[tok.left.name || tok.right.name], false);
  if(lex)
  {
    int new_state = t->insertTransducer(state, *lex);
    buildPattern(new_state, t, pat, is_free, pos+1);
  }
  return;
}
else
{
  Transducer *p = buildPattern(tok);
  if(!p->hasNoFinals())
  {
    int new_state = t->insertTransducer(state, *p);
    if(tok.mode & Optional)
      t->linkStates(state, new_state, 0);
    if(tok.mode & Repeated)
      t->linkStates(new_state, state, 0);
    buildPattern(new_state, t, pat, is_free, pos+1);
  }
}
1152}

1154vector<int>
1155LexdCompiler::determineFreedom(pattern_t& pat)
1156{
vector<int> is_free = vector<int>(pat.size(), 0);
map<string_ref, bool> is_optional;
for(unsigned int i = 0; i < pat.size(); i++)
{
  const pattern_element_t& t1 = pat[i];
  if (is_optional.find(t1.left.name) != is_optional.end() && is_optional[t1.left.name] != t1.optional()) {
    die("Lexicon %S cannot be both optional and non-optional in a single pattern.", err(name(t1.left.name))(to_ustring(name(t1.left.name)).c_str()));
  }
  if (is_optional.find(t1.right.name) != is_optional.end() && is_optional[t1.right.name] != t1.optional()) {
    die("Lexicon %S cannot be both optional and non-optional in a single pattern.", err(name(t1.right.name))(to_ustring(name(t1.right.name)).c_str()));
  }
  if (t1.left.name.valid()) {
    is_optional[t1.left.name] = t1.optional();
  }
  if (t1.right.name.valid()) {
    is_optional[t1.right.name] = t1.optional();
  }
  if(is_free[i] != 0)
    continue;
  for(unsigned int j = i+1; j < pat.size(); j++)
  {
    const pattern_element_t& t2 = pat[j];
    if((t1.left.name.valid() && (t1.left.name == t2.left.name || t1.left.name == t2.right.name)) ||
       (t1.right.name.valid() && (t1.right.name == t2.left.name || t1.right.name == t2.right.name)))
    {
      is_free[i] = -1;
      is_free[j] = -1;
    }
  }
  is_free[i] = (is_free[i] == 0 ? 1 : -1);
}
return is_free;
1189}

1191Transducer*
1192LexdCompiler::buildPattern(const pattern_element_t &tok)
1193{
if(tok.left.part != 1 || tok.right.part != 1)
  die("Cannot build collated pattern %S", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()));
if(patternTransducers.find(tok) == patternTransducers.end())
{
  if (verbose) cerr << "Compiling " << to_ustring(printPattern(tok)) << endl;
  auto start_time = chrono::steady_clock::now();
  Transducer* t = new Transducer();
  patternTransducers[tok] = NULL__null;
  map<string_ref, unsigned int> tempMatch;
  tempMatch.swap(matchedParts);
  for(auto &pat_untagged : patterns[tok.left.name])
  {
    for(unsigned int i = 0; i < pat_untagged.second.size(); i++)
    {
      auto pat = pat_untagged;
      bool taggable = true;
      for (unsigned int j = 0; j < pat.second.size(); j++) {
        auto& pair = pat.second[j];
        if(!pair.tag_filter.combine(tok.tag_filter.neg())) {
          taggable = false;
          if (verbose) {
            cerr << "Warning: The tags of " << to_ustring(printPattern(tok));
            cerr << " conflict with " << to_ustring(printPattern(pat_untagged.second[j]));
            cerr << " on line " << pat.first << "." << endl;
          }
        }
      }
      if(!pat.second[i].tag_filter.combine(tok.tag_filter.pos())) {
        taggable = false;
        if (verbose) {
          cerr << "Warning: The tags of " << to_ustring(printPattern(tok));
          cerr << " conflict with " << to_ustring(printPattern(pat_untagged.second[i]));
          cerr << " on line " << pat.first << "." << endl;
        }
      }
      if (!taggable) continue;

      matchedParts.clear();
      lineNumber = pat.first;
      vector<int> is_free = determineFreedom(pat.second);
      buildPattern(t->getInitial(), t, pat.second, is_free, 0);
    }
  }
  tempMatch.swap(matchedParts);
  if(!t->hasNoFinals())
  {
    if (verbose)
      cerr << "Minimizing " << to_ustring(printPattern(tok)) << endl;
    t->minimize();
  }
  else if (verbose) {
    cerr << "Warning: " << to_ustring(printPattern(tok));
    cerr << " is empty." << endl;
  }
  patternTransducers[tok] = t;
  if (verbose) {
    auto end_time = chrono::steady_clock::now();
    chrono::duration<double> diff = end_time - start_time;
    cerr << "Done compiling " << to_ustring(printPattern(tok));
    cerr << " in " << diff.count() << " seconds." << endl;
  }
}
else if(patternTransducers[tok] == NULL__null)
{
  die("Cannot compile self-recursive %S", err(printPattern(tok))(to_ustring(printPattern(tok)).c_str()));
}
return patternTransducers[tok];
1261}

1263int
1264LexdCompiler::insertPreTags(Transducer* t, int state, tag_filter_t &tags)
1265{
int end = state;
for(auto tag : tags.pos())
{
  trans_sym_t flag = getFlag(Positive, tag, 1);
  end = t->insertSingleTransduction((int)alphabet_lookup(flag, flag), end);
}
for(auto tag : tags.neg())
{
  trans_sym_t flag = getFlag(Positive, tag, 2);
  end = t->insertSingleTransduction((int)alphabet_lookup(flag, flag), end);
}
return end;
1278}

1280int
1281LexdCompiler::insertPostTags(Transducer* t, int state, tag_filter_t &tags)
1282{
int end = 0;
int flag_dest = 0;
for(auto tag : tags.pos())
{
  trans_sym_t flag = getFlag(Disallow, tag, 1);
  trans_sym_t clear = getFlag(Clear, tag, 0);
  if(flag_dest == 0)
  {
    flag_dest = t->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
    end = flag_dest;
  }
  else
  {
    t->linkStates(state, flag_dest, (int)alphabet_lookup(flag, flag));
  }
  end = t->insertSingleTransduction((int)alphabet_lookup(clear, clear), end);
}
if(end == 0)
{
  end = state;
}
for(auto tag : tags.neg())
{
  trans_sym_t clear = getFlag(Clear, tag, 0);
  end = t->insertSingleTransduction((int)alphabet_lookup(clear, clear), end);
}
return end;
1310}

1312Transducer*
1313LexdCompiler::buildPatternWithFlags(const pattern_element_t &tok, int pattern_start_state = 0)
1314{
if(patternTransducers.find(tok) == patternTransducers.end())
{
  if (verbose) cerr << "Compiling " << to_ustring(printPattern(tok)) << endl;
  auto start_time = chrono::steady_clock::now();
  Transducer* trans = (shouldHypermin ? hyperminTrans : new Transducer());
  patternTransducers[tok] = NULL__null;
  unsigned int transition_index = 0;
  vector<int> pattern_finals;
  bool did_anything = false;
  for(auto& pat : patterns[tok.left.name])
  {
    lineNumber = pat.first;
    vector<int> is_free = determineFreedom(pat.second);
    bool got_non_null = false;
    unsigned int count = (tok.tag_filter.pos().size() > 0 ? pat.second.size() : 1);
    if(tagsAsFlags) count = 1;
    for(unsigned int idx = 0; idx < count; idx++)
    {
      int state = pattern_start_state;
      vector<int> finals;
      set<string_ref> to_clear;
      bool got_null = false;
      for(unsigned int i = 0; i < pat.second.size(); i++)
      {
        pattern_element_t cur = pat.second[i];

        if(cur.left.name == left_sieve_name)
        {
          trans->linkStates(pattern_start_state, state, 0);
          continue;
        }
        else if(cur.left.name == right_sieve_name)
        {
          finals.push_back(state);
          continue;
        }

        bool isLex = isLexiconToken(cur);

        transition_index++;

        int mode_start = state;
        cur.mode = Normal;

        tag_filter_t current_tags;
        if(tagsAsFlags)
        {
          state = insertPreTags(trans, state, cur.tag_filter);
          current_tags = cur.tag_filter;
          cur.tag_filter = tag_filter_t();
        }
        else
        {
          if (i == idx && !cur.tag_filter.combine(tok.tag_filter.pos())) {
            if (verbose) {
              cerr << "Warning: The tags of " << to_ustring(printPattern(tok));
              cerr << " conflict with " << to_ustring(printPattern(pat.second[i]));
              cerr << " on line " << pat.first << "." << endl;
            }
          }
          if (!cur.tag_filter.combine(tok.tag_filter.neg())) {
            if (verbose) {
              cerr << "Warning: The tags of " << to_ustring(printPattern(tok));
              cerr << " conflict with " << to_ustring(printPattern(pat.second[i]));
              cerr << " on line " << pat.first << "." << endl;
            }
          }
        }

        Transducer* t;
        if(shouldHypermin)
        {
          trans_sym_t inflag = getFlag(Positive, tok.left.name, transition_index);
          trans_sym_t outflag = getFlag(Require, tok.left.name, transition_index);
          int in_tr = (int)alphabet_lookup(inflag, inflag);
          int out_tr = (int)alphabet_lookup(outflag, outflag);
          if(is_free[i] == -1 && isLex)
          {
            to_clear.insert(cur.left.name);
            to_clear.insert(cur.right.name);
          }
          if(transducerLocs.find(cur) != transducerLocs.end())
          {
            auto loc = transducerLocs[cur];
            if(loc.first == loc.second)
            {
              t = NULL__null;
            }
            else
            {
              t = trans;
              trans->linkStates(state, loc.first, in_tr);
              state = trans->insertSingleTransduction(out_tr, loc.second);
            }
          }
          else
          {
            int start = trans->insertSingleTransduction(in_tr, state);
            int end = start;
            if(isLex)
            {
              t = getLexiconTransducerWithFlags(cur, false);
              if(t == NULL__null)
              {
                transducerLocs[cur] = make_pair(start, start);
              }
              else
              {
                end = trans->insertTransducer(start, *t);
                transducerLocs[cur] = make_pair(start, end);
              }
            }
            else
            {
              t = buildPatternWithFlags(cur, start);
              end = transducerLocs[cur].second;
            }
            state = trans->insertSingleTransduction(out_tr, end);
          }
        }
        else if(isLex)
        {
          t = getLexiconTransducerWithFlags(cur, (is_free[i] == 1));
          if(is_free[i] == -1)
          {
            to_clear.insert(cur.left.name);
            to_clear.insert(cur.right.name);
          }
        }
        else
        {
          t = buildPatternWithFlags(cur);
        }
        if(t == NULL__null || (!shouldHypermin && t->hasNoFinals()))
        {
          got_null = true;
          break;
        }
        got_non_null = true;
        if(!shouldHypermin)
        {
          state = trans->insertTransducer(state, *t);
        }
        if(tagsAsFlags)
        {
          state = insertPostTags(trans, state, current_tags);
        }
        if(pat.second[i].mode & Optional)
        {
          trans->linkStates(mode_start, state, 0);
        }
        if(pat.second[i].mode & Repeated)
        {
          trans->linkStates(state, mode_start, 0);
        }
      }
      if(!got_null || finals.size() > 0)
      {
        for(auto fin : finals)
        {
          trans->linkStates(fin, state, 0);
        }
        for(auto lex : to_clear)
        {
          if(lex.empty())
          {
            continue;
          }
          UnicodeString flag = "@C.";
          encodeFlag(flag, (int)lex.i);
          flag += "@";
          trans_sym_t f = alphabet_lookup(flag);
          state = trans->insertSingleTransduction((int)alphabet_lookup(f, f), state);
        }
        trans->setFinal(state);
        pattern_finals.push_back(state);
      }
    }
    if(!got_non_null)
    {
      continue;
    }
    did_anything = true;
  }
  if(did_anything)
  {
    if(shouldHypermin)
    {
      if(pattern_finals.size() > 0)
      {
        int end = pattern_finals[0];
        for(auto fin : pattern_finals)
        {
          if(fin != end)
          {
            trans->linkStates(fin, end, 0);
          }
          if(pattern_start_state != 0)
          {
            trans->setFinal(fin, 0, false);
          }
        }
        pattern_element_t key = tok;
        key.mode = Normal;
        transducerLocs[key] = make_pair(pattern_start_state, end);
      }
    }
    else
    {
      if(!trans->hasNoFinals()) {
        if (verbose)
          cerr << "Minimizing " << to_ustring(printPattern(tok)) << endl;
        trans->minimize();
      }
    }
  }
  else
  {
    if(!shouldHypermin)
      trans = NULL__null;
    else
    {
      cerr << "FIXME" << endl;
    }
  }
  if (verbose) {
    auto end_time = chrono::steady_clock::now();
    chrono::duration<double> diff = end_time - start_time;
    cerr << "Done compiling " << to_ustring(printPattern(tok));
    cerr << " in " << diff.count() << " seconds." << endl;
  }
  patternTransducers[tok] = trans;
}
else if(patternTransducers[tok] == NULL__null)
{
  die("Cannot compile self-recursive pattern '%S'", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()));
}
return patternTransducers[tok];
1553}

1555void
1556LexdCompiler::buildAllLexicons()
1557{
// find out if there are any lexicons that we can build without flags
vector<pattern_element_t> lexicons_to_build;
for(auto pattern : patterns)
{
  for(auto pat : pattern.second)
  {
    lineNumber = pat.first;
    vector<int> free = determineFreedom(pat.second);
    for(size_t i = 0; i < pat.second.size(); i++)
    {
      if(pat.second[i].left.name == left_sieve_name ||
         pat.second[i].left.name == right_sieve_name)
      {
        continue;
      }
      if(isLexiconToken(pat.second[i]))
      {
        pattern_element_t& tok = pat.second[i];
        if(free[i] == -1)
        {
          lexiconFreedom[tok.left.name] = false;
          lexiconFreedom[tok.right.name] = false;
        }
        else
        {
          if(lexiconFreedom.find(tok.left.name) == lexiconFreedom.end())
          {
            lexiconFreedom[tok.left.name] = true;
          }
          if(lexiconFreedom.find(tok.right.name) == lexiconFreedom.end())
          {
            lexiconFreedom[tok.right.name] = true;
          }
        }
        lexicons_to_build.push_back(tok);
      }
    }
  }
}
lexiconFreedom[string_ref(0)] = true;
for(auto tok : lexicons_to_build)
{
  tok.tag_filter = tag_filter_t();
  tok.mode = Normal;
  bool free = ((tok.left.name.empty() || lexiconFreedom[tok.left.name]) &&
2
←
Assuming the condition is false→
               (tok.right.name.empty() || lexiconFreedom[tok.right.name]));
  getLexiconTransducerWithFlags(tok, free);
3
←
Calling 'LexdCompiler::getLexiconTransducerWithFlags'→
}
1606}

1608int
1609LexdCompiler::buildPatternSingleLexicon(pattern_element_t tok, int start_state)
1610{
if(patternTransducers.find(tok) == patternTransducers.end() || patternTransducers[tok] != NULL__null)
{
  patternTransducers[tok] = NULL__null;
  int end = -1;
  string_ref transition_flag = internName(" ");
  for(auto pattern : patterns[tok.left.name])
  {
    int next_start_state = start_state;
    size_t next_start_idx = 0;
    lineNumber = pattern.first;
    set<string_ref> to_clear;
    size_t count = (tok.tag_filter.pos().empty() ? 1 : pattern.second.size());
    for(size_t tag_idx = 0; tag_idx < count; tag_idx++)
    {
      int state = next_start_state;
      bool finished = true;
      for(size_t i = next_start_idx; i < pattern.second.size(); i++)
      {
        pattern_element_t cur = pattern.second[i];

        if(cur.left.name == left_sieve_name)
        {
          hyperminTrans->linkStates(start_state, state, 0);
          continue;
        }
        else if(cur.left.name == right_sieve_name)
        {
          if(end == -1)
          {
            end = hyperminTrans->insertNewSingleTransduction(0, state);
          }
          else
          {
            hyperminTrans->linkStates(state, end, 0);
          }
          continue;
        }

        if(i == tag_idx)
        {
          next_start_state = state;
          next_start_idx = tag_idx;
          cur.tag_filter.combine(tok.tag_filter.pos());
        }
        cur.tag_filter.combine(tok.tag_filter.neg());

        int mode_state = state;

        if(isLexiconToken(cur))
        {
          tags_t tags = cur.tag_filter.tags();
          for(auto tag : tags)
          {
            trans_sym_t flag = getFlag(Clear, tag, 0);
            state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
          }
          pattern_element_t untagged = cur;
          untagged.tag_filter = tag_filter_t();
          untagged.mode = Normal;
          bool free = (lexiconFreedom[cur.left.name] && lexiconFreedom[cur.right.name]);
          if(!free)
          {
            to_clear.insert(cur.left.name);
            to_clear.insert(cur.right.name);
          }
          trans_sym_t inflag = getFlag(Positive, transition_flag, transitionCount);
          trans_sym_t outflag = getFlag(Require, transition_flag, transitionCount);
          transitionCount++;
          if(transducerLocs.find(untagged) == transducerLocs.end())
          {
            state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(inflag, inflag), state);
            Transducer* lex = getLexiconTransducerWithFlags(untagged, free);
            int start = state;
            state = hyperminTrans->insertTransducer(state, *lex);
            transducerLocs[untagged] = make_pair(start, state);
          }
          else
          {
            auto loc = transducerLocs[untagged];
            hyperminTrans->linkStates(state, loc.first, (int)alphabet_lookup(inflag, inflag));
            state = loc.second;
          }
          state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(outflag, outflag), state);
          for(auto tag : cur.tag_filter.pos())
          {
            trans_sym_t flag = getFlag(Require, tag, 1);
            state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
          }
          for(auto tag : cur.tag_filter.neg())
          {
            trans_sym_t flag = getFlag(Disallow, tag, 1);
            state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
          }
        }
        else
        {
          state = buildPatternSingleLexicon(cur, state);
          if(state == -1)
          {
            finished = false;
            break;
          }
        }

        if(cur.mode & Optional)
        {
          hyperminTrans->linkStates(mode_state, state, 0);
        }
        if(cur.mode & Repeated)
        {
          hyperminTrans->linkStates(state, mode_state, 0);
        }
      }
      if(finished)
      {
        for(auto lex : to_clear)
        {
          if(lex.empty())
          {
            continue;
          }
          trans_sym_t flag = getFlag(Clear, lex, 0);
          state = hyperminTrans->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
        }
        if(end == -1)
        {
          end = state;
        }
        else
        {
          hyperminTrans->linkStates(state, end, 0);
        }
      }
    }
  }
  patternTransducers.erase(tok);
  return end;
}
else
{
  die("Cannot compile self-recursive pattern '%S'", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()));
  return 0;
}
1754}

1756void
1757LexdCompiler::readFile(UFILE* infile)
1758{
input = infile;
doneReading = false;
while(!u_feofu_feof_72(input))
{
  processNextLine();
  if(doneReading) break;
}
finishLexicon();
1767}

1769Transducer*
1770LexdCompiler::buildTransducer(bool usingFlags)
1771{
token_t start_tok = {.name = internName(" "), .part = 1, .optional = false};
pattern_element_t start_pat = {.left=start_tok, .right=start_tok,
                               .tag_filter=tag_filter_t(),
                               .mode=Normal};
if(usingFlags)
{
  if(shouldHypermin)
  {
    hyperminTrans = new Transducer();
  }
  Transducer *t = buildPatternWithFlags(start_pat);
  if(shouldHypermin)
    t->minimize();
  return t;
}
else return buildPattern(start_pat);
1788}

1790Transducer*
1791LexdCompiler::buildTransducerSingleLexicon()
1792{
tagsAsMinFlags = true;
token_t start_tok = {.name = internName(" "), .part = 1, .optional = false};
pattern_element_t start_pat = {.left=start_tok, .right=start_tok,
                               .tag_filter=tag_filter_t(),
                               .mode=Normal};
hyperminTrans = new Transducer();
buildAllLexicons();
1
Calling 'LexdCompiler::buildAllLexicons'→
int end = buildPatternSingleLexicon(start_pat, 0);
if(end == -1)
{
  cerr << "WARNING: No non-empty patterns found." << endl;
}
else {
  hyperminTrans->setFinal(end);
  hyperminTrans->minimize();
}
return hyperminTrans;
1810}

1812void expand_alternation(vector<pattern_t> &pats, const vector<pattern_element_t> &alternation)
1813{
if(alternation.empty())
  return;
if(pats.empty())
  pats.push_back(pattern_t());
vector<pattern_t> new_pats;
for(const auto &pat: pats)
{
  for(const auto &tok: alternation)
  {
    auto pat1 = pat;
    pat1.push_back(tok);
    new_pats.push_back(pat1);
  }
}
pats = new_pats;
1829}

1831void
1832LexdCompiler::insertEntry(Transducer* trans, const lex_seg_t &seg)
1833{
int state = trans->getInitial();
if(tagsAsFlags)
{
  for(string_ref tag : seg.tags)
  {
    trans_sym_t check1 = getFlag(Require, tag, 1);
    trans_sym_t check2 = getFlag(Disallow, tag, 2);
    trans_sym_t clear = getFlag(Clear, tag, 0);
    int state2 = trans->insertSingleTransduction((int)alphabet_lookup(check1, check1), state);
    int state3 = trans->insertSingleTransduction((int)alphabet_lookup(clear, clear), state2);
    trans->linkStates(state, state3, 0);
    state = trans->insertSingleTransduction((int)alphabet_lookup(check2, check2), state3);
  }
}
else if(tagsAsMinFlags)
{
  for(string_ref tag : seg.tags)
  {
    trans_sym_t flag = getFlag(Positive, tag, 1);
    state = trans->insertSingleTransduction((int)alphabet_lookup(flag, flag), state);
  }
}
if (seg.regex != nullptr) {
  state = trans->insertTransducer(state, *seg.regex);
}
if(!shouldAlign)
{
  for(unsigned int i = 0; i < seg.left.symbols.size() || i < seg.right.symbols.size(); i++)
  {
    trans_sym_t l = (i < seg.left.symbols.size()) ? seg.left.symbols[i] : trans_sym_t();
    trans_sym_t r = (i < seg.right.symbols.size()) ? seg.right.symbols[i] : trans_sym_t();
    state = trans->insertSingleTransduction(alphabet((int)l, (int)r), state);
  }
}
else
{
  /*
    This code is adapted from hfst/libhfst/src/parsers/lexc-utils.cc
    It uses the Levenshtein distance algorithm to determine the optimal
    alignment of two strings.
    In hfst-lexc, the priority order for ties is SUB > DEL > INS
    which ensures that 000abc:xyz000 is preferred over abc000:000xyz
    However, we're traversing the strings backwards to simplify extracting
    the final alignment, so we need to switch INS and DEL.
    If shouldCompress is true, we set the cost of SUB to 1 in order to prefer
    a:b over 0:b a:0 without changing the alignment of actual correspondences.
  */
  const unsigned int INS = 0;
  const unsigned int DEL = 1;
  const unsigned int SUB = 2;
  const unsigned int ins_cost = 1;
  const unsigned int del_cost = 1;
  const unsigned int sub_cost = (shouldCompress ? 1 : 100);

  const unsigned int len1 = seg.left.symbols.size();
  const unsigned int len2 = seg.right.symbols.size();
  unsigned int cost[len1+1][len2+1];
  unsigned int path[len1+1][len2+1];
  cost[0][0] = 0;
  path[0][0] = 0;
  for(unsigned int i = 1; i <= len1; i++)
  {
    cost[i][0] = del_cost * i;
    path[i][0] = DEL;
  }
  for(unsigned int i = 1; i <= len2; i++)
  {
    cost[0][i] = ins_cost * i;
    path[0][i] = INS;
  }

  for(unsigned int i = 1; i <= len1; i++)
  {
    for(unsigned int j = 1; j <= len2; j++)
    {
      unsigned int sub = cost[i-1][j-1] + (seg.left.symbols[len1-i] == seg.right.symbols[len2-j] ? 0 : sub_cost);
      unsigned int ins = cost[i][j-1] + ins_cost;
      unsigned int del = cost[i-1][j] + del_cost;

      if(sub <= ins && sub <= del)
      {
        cost[i][j] = sub;
        path[i][j] = SUB;
      }
      else if(ins <= del)
      {
        cost[i][j] = ins;
        path[i][j] = INS;
      }
      else
      {
        cost[i][j] = del;
        path[i][j] = DEL;
      }
    }
  }

  for(unsigned int x = len1, y = len2; (x > 0) || (y > 0);)
  {
    trans_sym_t symbol;
    switch(path[x][y])
    {
      case SUB:
        symbol = alphabet_lookup(seg.left.symbols[len1-x], seg.right.symbols[len2-y]);
        x--;
        y--;
        break;
      case INS:
        symbol = alphabet_lookup(trans_sym_t(), seg.right.symbols[len2-y]);
        y--;
        break;
      default: // DEL
        symbol = alphabet_lookup(seg.left.symbols[len1-x], trans_sym_t());
        x--;
    }
    state = trans->insertSingleTransduction((int)symbol, state);
  }
}
trans->setFinal(state);
1953}

1955void
1956LexdCompiler::applyMode(Transducer* trans, RepeatMode mode)
1957{
if(mode == Question)
  trans->optional();
else if(mode == Star)
  trans->zeroOrMore();
else if(mode == Plus)
  trans->oneOrMore();
1964}

1966Transducer*
1967LexdCompiler::getLexiconTransducer(pattern_element_t tok, unsigned int entry_index, bool free)
1968{
if(!free && entryTransducers.find(tok) != entryTransducers.end())
  return entryTransducers[tok][entry_index];
if(free && lexiconTransducers.find(tok) != lexiconTransducers.end())
  return lexiconTransducers[tok];

vector<entry_t>& lents = lexicons[tok.left.name];
if(tok.left.name.valid() && tok.left.part > lents[0].size())
  die("%S(%d) - part is out of range", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), tok.left.part);
vector<entry_t>& rents = lexicons[tok.right.name];
if(tok.right.name.valid() && tok.right.part > rents[0].size())
  die("%S(%d) - part is out of range", err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()), tok.right.part);
if(tok.left.name.valid() && tok.right.name.valid() && lents.size() != rents.size())
  die("Cannot collate %S with %S - differing numbers of entries", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
unsigned int count = (tok.left.name.valid() ? lents.size() : rents.size());
vector<Transducer*> trans;
if(free)
  trans.push_back(new Transducer());
else
  trans.reserve(count);
lex_seg_t empty;
bool did_anything = false;
for(unsigned int i = 0; i < count; i++)
{
  lex_seg_t& le = (tok.left.name.valid() ? lents[i][tok.left.part-1] : empty);
  lex_seg_t& re = (tok.right.name.valid() ? rents[i][tok.right.part-1] : empty);
  tags_t tags = unionset(le.tags, re.tags);
  if(!tok.tag_filter.compatible(tags))
  {
    if(!free)
      trans.push_back(NULL__null);
    continue;
  }
  Transducer* t = free ? trans[0] : new Transducer();
  if (le.regex != nullptr || re.regex != nullptr) {
    if (tok.left.name.empty())
      die("Cannot use %S one-sided - it contains a regex", err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
    if (tok.right.name.empty())
      die("Cannot use %S one-sided - it contains a regex", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()));
    if (tok.left.name != tok.right.name)
      die("Cannot collate %S with %S - %S contains a regex", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()), err(name((le.regex != nullptr ? tok.left.name : tok.right.name)))(to_ustring(name((le.regex != nullptr ? tok.left.name : tok.right
.name))).c_str()));
  }
  insertEntry(t, {.left=le.left, .right=re.right, .regex=le.regex, .tags=tags});
  did_anything = true;
  if(!free)
  {
    applyMode(t, tok.mode);
    trans.push_back(t);
  }
}
if(tok.optional()) {
  Transducer* t = free ? trans[0] : new Transducer();
  tags_t empty_tags;
  insertEntry(t, {.left=empty.left, .right=empty.right, .regex=nullptr, .tags=empty_tags});
  did_anything = true;
  if (!free) {
    applyMode(t, tok.mode);
    trans.push_back(t);
  }
  did_anything = true;
}
if(free)
{
  if(!did_anything)
  {
    trans[0] = NULL__null;
  }
  if(trans[0])
  {
    trans[0]->minimize();
    applyMode(trans[0], tok.mode);
  }
  lexiconTransducers[tok] = trans[0];
  return trans[0];
}
else
{
  entryTransducers[tok] = trans;
  return trans[entry_index];
}
2048}

2050void
2051LexdCompiler::encodeFlag(UnicodeString& str, int flag)
2052{
UnicodeString letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int num = flag;
while(num > 0)
{
  str += letters[num % 26];
  num /= 26;
}
2060}

2062trans_sym_t
2063LexdCompiler::getFlag(FlagDiacriticType type, string_ref flag, unsigned int value)
2064{
//cerr << "getFlag(" << type << ", " << to_ustring(name(flag)) << ", " << value << ")" << endl;
UnicodeString flagstr = "@";
switch(type)
{
  case Unification:
    //cerr << "  Unification" << endl;
    flagstr += "U."; break;
  case Positive:
    //cerr << "  Positive" << endl;
    flagstr += "P."; break;
  case Negative:
    //cerr << "  Negative" << endl;
    flagstr += "N."; break;
  case Require:
    //cerr << "  Require" << endl;
    flagstr += "R."; break;
  case Disallow:
    //cerr << "  Disallow" << endl;
    flagstr += "D."; break;
  case Clear:
    //cerr << "  Clear" << endl;
    flagstr += "C."; break;
}
encodeFlag(flagstr, (int)flag.i);
if(type != Clear)
{
  flagstr += ".";
  encodeFlag(flagstr, (int)(value + 1));
}
flagstr += "@";
return alphabet_lookup(flagstr);
2096}

2098Transducer*
2099LexdCompiler::getLexiconTransducerWithFlags(pattern_element_t& tok, bool free)
2100{
if(!free3.1
'free' is false
 && entryTransducers.find(tok) != entryTransducers.end())
  return entryTransducers[tok][0];
if(free3.2
'free' is false
 && lexiconTransducers.find(tok) != lexiconTransducers.end())
4
←
Taking false branch→
  return lexiconTransducers[tok];

// TODO: can this be abstracted from here and getLexiconTransducer()?
vector<entry_t>& lents = lexicons[tok.left.name];
if(tok.left.name.valid() && tok.left.part > lents[0].size())
5
←
Assuming the condition is false→
6
←
Taking false branch→
  die("%S(%d) - part is out of range", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), tok.left.part);
vector<entry_t>& rents = lexicons[tok.right.name];
if(tok.right.name.valid() && tok.right.part > rents[0].size())
  die("%S(%d) - part is out of range", err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()), tok.right.part);
if(tok.left.name.valid() && tok.right.name.valid() && lents.size() != rents.size())
  die("Cannot collate %S with %S - differing numbers of entries", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
unsigned int count = (tok.left.name.valid() ? lents.size() : rents.size());
7
←
'?' condition is true→
Transducer* trans = new Transducer();
8
←
Memory is allocated→
lex_seg_t empty;
bool did_anything = false;
for(unsigned int i = 0; i < count; i++)
9
←
Assuming 'i' is >= 'count'→
10
←
Loop condition is false. Execution continues on line 2162→
{
  lex_seg_t& le = (tok.left.name.valid() ? lents[i][tok.left.part-1] : empty);
  lex_seg_t& re = (tok.right.name.valid() ? rents[i][tok.right.part-1] : empty);
  tags_t tags = unionset(le.tags, re.tags);
  if(!tok.tag_filter.compatible(tags))
  {
    continue;
  }
  did_anything = true;
  lex_seg_t seg;
  if (le.regex != nullptr || re.regex != nullptr) {
    if (tok.left.name.empty())
      die("Cannot use %S one-sided - it contains a regex", err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()));
    if (tok.right.name.empty())
      die("Cannot use %S one-sided - it contains a regex", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()));
    if (tok.left.name != tok.right.name)
      die("Cannot collate %S with %S - %S contains a regex", err(name(tok.left.name))(to_ustring(name(tok.left.name)).c_str()), err(name(tok.right.name))(to_ustring(name(tok.right.name)).c_str()), err(name((le.regex != nullptr ? tok.left.name : tok.right.name)))(to_ustring(name((le.regex != nullptr ? tok.left.name : tok.right
.name))).c_str()));
    seg.regex = le.regex;
  }
  if(!free && tok.left.name.valid())
  {
    trans_sym_t flag = getFlag(Unification, tok.left.name, i);
    seg.left.symbols.push_back(flag);
    seg.right.symbols.push_back(flag);
  }
  if(!free && tok.right.name.valid() && tok.right.name != tok.left.name)
  {
    trans_sym_t flag = getFlag(Unification, tok.right.name, i);
    seg.left.symbols.push_back(flag);
    seg.right.symbols.push_back(flag);
  }
  if(tok.left.name.valid())
  {
    seg.left.symbols.insert(seg.left.symbols.end(), le.left.symbols.begin(), le.left.symbols.end());
  }
  if(tok.right.name.valid())
  {
    seg.right.symbols.insert(seg.right.symbols.end(), re.right.symbols.begin(), re.right.symbols.end());
  }
  seg.tags.insert(tags.begin(), tags.end());
  insertEntry(trans, seg);
}
if(tok.optional()) {
11
←
Taking false branch→
  lex_seg_t seg;
  if (!free && tok.left.name.valid()) {
    trans_sym_t flag = getFlag(Unification, tok.left.name, count);
    seg.left.symbols.push_back(flag);
    seg.right.symbols.push_back(flag);
  }
  if (!free && tok.right.name.valid() && tok.right.name != tok.left.name) {
    trans_sym_t flag = getFlag(Unification, tok.right.name, count);
    seg.left.symbols.push_back(flag);
    seg.right.symbols.push_back(flag);
  }
  insertEntry(trans, seg);
}
if(did_anything11.1
'did_anything' is false
)
12
←
Taking false branch→
{
  trans->minimize();
  applyMode(trans, tok.mode);
}
else
{
  trans = NULL__null;
}
if(free)
13
←
Potential leak of memory pointed to by 'trans'
{
  lexiconTransducers[tok] = trans;
}
else
{
  entryTransducers[tok] = vector<Transducer*>(1, trans);
}
return trans;
2194}

2196void
2197LexdCompiler::printStatistics() const
2198{
cerr << "Lexicons: " << lexicons.size() << endl;
cerr << "Lexicon entries: ";
unsigned int x = 0;
for(const auto &lex: lexicons)
  x += lex.second.size();
cerr << x << endl;
x = 0;
cerr << "Patterns: " << patterns.size() << endl;
cerr << "Pattern entries: ";
for(const auto &pair: patterns)
  x += pair.second.size();
cerr << x << endl;
cerr << endl;
cerr << "Counts for individual lexicons:" << endl;
unsigned int anon = 0;
for(const auto &lex: lexicons)
{
if(empty(lex.first)) continue;
UString n = to_ustring(name(lex.first));
if(n[0] == ' ') anon += lex.second.size();
else cerr << n << ": " << lex.second.size() << endl;
}
cerr << "All anonymous lexicons: " << anon << endl;
2222}