Please support our Computer Science and Software Design advertiser: Programming Forums
Views: 1379 | Replies: 3
![]() |
•
•
Join Date: Mar 2006
Posts: 12
Reputation:
Rep Power: 3
Solved Threads: 0
How can I write regular expressions(REs) for any language that are syntactically correct.
For example, Turkish has two classes of vowels — front and back. Vowel harmony states that words may not contain both front and back vowels. Therefore, most grammatical suffixes come in front and back forms, e.g. Türkiye'de "in Turkey" but kapıda "at the door".
front = { a, ı, o, u }
back = { e, i, ö, ü }
And how can I draw a Finite Automato for these REs
Can anyone give me simple examples.
I will try to write regular expression for the whole grammar of language and than write the code in C. But need some starting point.
For example, Turkish has two classes of vowels — front and back. Vowel harmony states that words may not contain both front and back vowels. Therefore, most grammatical suffixes come in front and back forms, e.g. Türkiye'de "in Turkey" but kapıda "at the door".
front = { a, ı, o, u }
back = { e, i, ö, ü }
And how can I draw a Finite Automato for these REs
Can anyone give me simple examples.
I will try to write regular expression for the whole grammar of language and than write the code in C. But need some starting point.
![]() |
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)






Linear Mode