msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

corrected some minor typos in reference manual

Browse Source
This commit is contained in:
gear0
2019-05-05 12:09:31 +02:00
parent c628e11c01
commit 92720b92a4
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
doc/gf-refman.md
View File

@@ -72,7 +72,7 @@ concrete syntax. Tree formation in abstract syntax, however, is fully
recursive. recursive.
Even though run-time GF grammars manipulate just nested tuples, at Even though run-time GF grammars manipulate just nested tuples, at
compile time these are represented by by the more fine-grained labelled compile time these are represented by the more fine-grained labelled
records and finite functions over algebraic datatypes. This enables the records and finite functions over algebraic datatypes. This enables the
programmer to write on a higher abstraction level, and also adds type programmer to write on a higher abstraction level, and also adds type
distinctions and hence raises the level of checking of programs. distinctions and hence raises the level of checking of programs.
@@ -99,7 +99,7 @@ module looks as follows:
} }
Here are two concrete syntax modules, one intended for mapping the trees Here are two concrete syntax modules, one intended for mapping the trees
to English, the other to Swedish. The mappling is defined by `lincat` to English, the other to Swedish. The mapping is defined by `lincat`
definitions assigning a **linearization type** to each category, and definitions assigning a **linearization type** to each category, and
`lin` definitions assigning a **linearization** to each function. `lin` definitions assigning a **linearization** to each function.
@@ -2515,7 +2515,7 @@ The reserved words used in GF are the following:
- `transfer` - `transfer`
- `variants` - `variants`
- `where` - `where`
- `with` - `with`
The symbols used in GF are the following: The symbols used in GF are the following: