Sökning: "grammars"
Visar resultat 1 - 5 av 46 uppsatser innehållade ordet grammars.
1. Type Checker Generation using Reference Attribute Grammars
Master-uppsats, Lunds universitet/Institutionen för datavetenskapSammanfattning : .... LÄS MER
2. SinfoJ: A simple Information Flow Analysis with Reference Attribute Grammars
Master-uppsats, Lunds universitet/Institutionen för datavetenskapSammanfattning : .... LÄS MER
3. Standard Arabic and Scottish Gaelic: Shared typological features
Magister-uppsats, Göteborgs universitet/Institutionen för filosofi, lingvistik och vetenskapsteoriSammanfattning : Although Celtic languages and Semitic languages belong to separate language families, they share numerous typological similarities that are common to Semitic languages but not shared by Standard Indo-European languages. The occurrence and the reasons for these similarities have been the focus of a whole research field, concerned with linguistic, historical, and anthropological hypotheses about possible reasons for said similarities, as well as with linguistic analyses and comparisons of specific Celtic and Semitic languages, such as Hebrew, Welsh and Breton. LÄS MER
4. 'In the moment' : A cross-linguistic exploration of the lexical concept [MOMENT]
Master-uppsats, Stockholms universitet/Avdelningen för allmän språkvetenskapSammanfattning : Lexical typological studies examine how various languages express similar concepts. Previous research has discussed how the concept of moment is encoded lexically in English, Ancient Greek, and Ancient Egyptian. However, there are no cross-linguistic studies to date that collect data on the lexical expressions associated with the concept of moment. LÄS MER
5. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic
Master-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. LÄS MER