2c:null 2d:["$","title",null,{"children":"A context-free grammar for palindrome numbers that use a dot to separate thousands | Kelley van Evert | Observable"}] 32:T5c3,html`

${md` | k | P0 | P1 | P2 | P3 | | --: | --: | --: | --: | --: | |0 | | | | λ | |1 | | | | 1 | |2| | | | 11 | |0 | | | 2 | 121 | |1 | | | (**DOT**) •22 | 1•221 | |2| | (**DOT**) •3 | 2•32 | 12•321 | |0 | (**DOT**) • | 3•3 | 23•32 | 123•321 | |1 | 4• | 34•3 | (**DOT**) •234•32 | 1•234•321 | |2| 44• | (**DOT**) •344•3 | 2•344•32 | 12•344•321 | |0 | (**DOT**) •454• | 3•454•3 | 23•454•32 | 123•454•321 | |1 | 4•554• | 34•554•3 | (**DOT**) •234•554•32 | 1•234•554•321 | |2| 45•654• | (**DOT**) •345•654•3 | 2•345•654•32 | 12•345•654•321 | |0 | (**DOT**) •456•654• | 3•456•654•3 | 23•456•654•32 | 123•456•654•321 | | ... | ... | ... | ... | ... | `}

`33:T560,html`

  P ::= P30 | P31 | P32

  P30 ::=         d   P20 d     ( ∀d∈[0..9] )
  P31 ::=     d | d • P21 d     ( ∀d∈[0..9] )
  P32 ::=   d d | d   P22 d     ( ∀d∈[0..9] )

  P20 ::=     d | d   P10 d     ( ∀d∈[0..9] )
  P21 ::=   d d | d   P11 d     ( ∀d∈[0..9] )
  P22 ::=         d • P12 d     ( ∀d∈[0..9] )

  P10 ::= d • d | d • P00 d     ( ∀d∈[0..9] )
  P11 ::=         d   P01 d     ( ∀d∈[0..9] )
  P12 ::=     d | d   P02 d     ( ∀d∈[0..9] )

  P00 ::=         d   P20 d •   ( ∀d∈[0..9] )
  P01 ::=   d • | d • P21 d •   ( ∀d∈[0..9] )
  P02 ::= d d • | d   P22 d •   ( ∀d∈[0..9] )

`34:T7da,html`

${tests.map(([s, b]) => { const trees = parse(s); const succeeded = !!trees; const posneg = succeeded ? 'positive' : 'negative'; const trufal = succeeded == b ? 'true' : 'false'; return `

${s ? s.replace(/•/g, '.') : 'λ'}

${trufal} ${posneg}

${trees ? `

${trees.map(tree => `

${toNestedList(tree)}

`).join('')}

` : ''}

`; }).join('')}