---
channels:
  p: "Pathsim"

# replace:
#   val:
#     - S:
#         default: ["{}{}"]

# Simple infinite recursion
A:
  - val: "{A} {A}"

a:
  - val: "a{b}"
    ipa: "a"
  - val: ""
    ipa: "A"
b:
  - val: "b{c}"
  - val: "bb{c}b"
    ipa: "b"
c:
  - val: "{d}c"
    ipa: "c"
d:
  - val: "d{e}"
    ipa: "d"
  - val: "d{f}"
    ipa: "d"
e:
  - val: "e{f}e"
    ipa: "e"
f:
  - val: "f{g}"
    ipa: "f"
  - val: "0"
    ipa: "0"
    freq: 0
g:
  - val: "g{a} {a}g"
    ipa: "g"
  - val: "{e}"
    ipa: "g."

x:
  - val: ".{y}."
    ipa: x
y:
  - val: q
    ipa: q
  - val: w
    ipa: w
  - val: e
    ipa: e

# "Wide" expansion demonstration (limited to depth**2 expansions)
W:
  - val: "{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}{W}"

depth:
  - val: "{depth|0}"
depth|:
  - val: "<rpn(12|#0|1|+|*|#d|/)> {depth|1}"

# This node produces its own path
# Currently broken in both WordGen/Py and WordGen/Cpp
# Literal nodes add a lot of complexity and don't enable much besides these
# little tricks so it may not be fixed.
P:
  - val: "+0"
    p: "+0"
    freq: .1
  - val: "+1{R:.5}"
    p: "+1"
  - val: "+2{R:.5}{R:.75}"
    p: "+2"
R:
  - p: "[0]"
  - val: "{R:1.1}{R/]}"
    p: "[1"
  - val: "{R:1.2}{R:1.2}{R/]}"
    p: "[2"
# This is a literal node. The idea is that it can be expanded without
# counting toward the depth or expansion limits, and it can't contain any
# node-references.
R/]:
  p: "]"

P1:
  - val: "{P1:1 0}{R/]}"
    p: '[0'
    freq: 0
  - val: "{P1/+}{P1:1 0}{R/]}{endl}"
P1/+:
  - p: "+1"
endl:
  - p: "\n"

# Demonstrates that in HTML mode the output is escaped
html:
  - val: "<</td>>"

test|...:
  - val: "<if(#0|t|f)><.(...)>"

freqtest:
  - val: "0"
    freq: 0
  - val: "1"
  - val: "2"
    freq: 10
  - val: "3"
    freq: .1
  - val: "4"
    freq: 0
  - val: "5"
    freq: 6
  - val: "6"
  - val: "7"
    freq: -2


Lexember:
  - val: "Firen"
    freq: 8
  - val: "Jafren"
    freq: 8
  - val: "Xanz"
    freq: 9
  - val: "DVSK"
    freq: 10