diff options
| author | John J. Camilleri <john@johnjcamilleri.com> | 2019-05-06 08:11:02 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-05-06 08:11:02 +0200 |
| commit | ac1f304722f77dbe5a0a439c9c5269dc098c9028 (patch) | |
| tree | df60d80440947373551816f6bf292ef1e6829782 | |
| parent | 078440ffbf031fc1b059490fbc9893b9e111d795 (diff) | |
| parent | 92720b92a4fad8193baac0be9fa4dccbc596fb30 (diff) | |
Merge pull request #42 from gear0/master
corrected some minor typos in reference manual
| -rw-r--r-- | doc/gf-refman.md | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/doc/gf-refman.md b/doc/gf-refman.md index 3ae3eb866..2a53041d9 100644 --- a/doc/gf-refman.md +++ b/doc/gf-refman.md @@ -72,7 +72,7 @@ concrete syntax. Tree formation in abstract syntax, however, is fully recursive. 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 programmer to write on a higher abstraction level, and also adds type 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 -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 `lin` definitions assigning a **linearization** to each function. @@ -2515,7 +2515,7 @@ The reserved words used in GF are the following: - `transfer` - `variants` - `where` -- `with` +- `with` The symbols used in GF are the following: |