grammar: Difference between revisions
mNo edit summary |
m (Text replace - "jbocre: t" to "t") |
||
Line 55: | Line 55: | ||
* [[jboske|jboske (lojbanology)]] | * [[jboske|jboske (lojbanology)]] | ||
* [[ | * [[type 4 fu'ivla]] | ||
* [[elidable terminator|elidable terminator]] | * [[elidable terminator|elidable terminator]] | ||
* [[jbocre: WordResolutionAlgorithm|WordResolutionAlgorithm]] | * [[jbocre: WordResolutionAlgorithm|WordResolutionAlgorithm]] |
Revision as of 12:15, 23 March 2014
Lojban has an unambiguous grammar based on the principles of logic. This grammar is a fundamental part of what makes Lojban the language it is. As a consequence, it has received careful study and criticism.
An unambiguous grammar is formal and regular. There is a single, unambiguous structure (called a parse tree) resulting from any text. Lojban grammar does not specify semantics. The meaning of any particular parse tree is outside the scope of the grammar.
History
Official Grammar
- Lojban Formal Grammars
- BPFK Section: Formal Grammar, a proposal to define the Lojban formal grammar in PEG.
PEG
.alyn.post. is working on a proposal for a 4th baseline for the Lojban machine grammar, replacing the YACC specification with PEG.
Main Article: PEG
Implementations of a Lojban grammar
Detailed Discussion
The following pages contain technical details and discussion concerning Lojban's grammar:
Further Reading
See Also
Uncategorized Material
The following material relates to Lojban's grammar but has not yet been reviewed for curation: