Kuna: Difference between revisions
(describe kuna) |
m (clarify) |
||
| Line 6: | Line 6: | ||
# Parsing the token stream into a [[surface structure]] tree using an [https://en.wikipedia.org/wiki/Earley_parser Earley parser]. | # Parsing the token stream into a [[surface structure]] tree using an [https://en.wikipedia.org/wiki/Earley_parser Earley parser]. | ||
# Recovery of the [[deep structure]] as a binary tree that conforms to Toaq's [[syntax]]. | # Recovery of the [[deep structure]] as a binary tree that conforms to Toaq's [[syntax]]. | ||
# Denotation of the syntax tree, using Toaq's [[semantics]]. | # Denotation of the syntax tree (i.e. assigning a formula to each subtree), using Toaq's [[semantics]]. | ||
# Rendering of the tree as LaTeX, png, … | # Rendering of the tree as LaTeX, png, … | ||
The code is [https://github.com/toaq/kuna on GitHub]. | The code is [https://github.com/toaq/kuna on GitHub]. | ||
Latest revision as of 21:47, 7 August 2023
Kuna is a program for parsing Toaq Delta. It aims to be a computer translation of the syntax and semantics pages of the refgram: a program that can turn Toaq sentences into parse trees and logical-form sentences.
It performs the following steps in order:
- Cleanup and tokenization of an input Toaq sentence.
- Parsing the token stream into a surface structure tree using an Earley parser.
- Recovery of the deep structure as a binary tree that conforms to Toaq's syntax.
- Denotation of the syntax tree (i.e. assigning a formula to each subtree), using Toaq's semantics.
- Rendering of the tree as LaTeX, png, …
The code is on GitHub.