Computer Science – Cryptography and Security
Scientific paper
2010-09-21
Computer Science
Cryptography and Security
Scientific paper
Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types of grammars, which do not exactly fit in Chomsky's classification, such as the two-level grammars. As their name suggests it, the main idea behind these grammars is that they are composed of two grammars. Van Wijngaarden grammars, particularly, are such grammars. They are interesting by their power (expressiveness), which can be the same, under some hypotheses, as the most powerful grammars of Chomsky's classification, i.e. Type 0 grammars. Another point of interest is their relative conciseness and readability. Van Wijngaarden grammars can describe static and dynamic semantic of a language. So, by using them as a generative engine, it is possible to generate a possibly infinite set of words, while assuring us that they all have the same semantic. Moreover, they can describe K-ary codes, by describing the semantic of each components of a code.
No associations
LandOfFree
Van Wijngaarden grammars, metamorphism and K-ary malwares does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Van Wijngaarden grammars, metamorphism and K-ary malwares, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Van Wijngaarden grammars, metamorphism and K-ary malwares will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-697267