Abstract
Formal definition of a natural language lets computers understand it; the languages have challenging complexity to come under representation of any formal language. Modeling assumptions, using formal languages, we can approximate the languages; and better approximation we do, more complexities of formal languages are resolved. Objective is to study current researches and possibilities to model Dari as a context-free language. Researchers have worked for more than 6 decades on definition of syntax of natural languages using context-free grammer. It is crucial that computer scientists to be able to thoroughly understand about which category of formal languages the natural language exist in in. In overall, our skill to decide the grammar type of natural languages performs a significant role in our capability to parse it. This review article concludes that discussed issue of the context-freeness of a certain language is regularly reliant on upon the level of complexity of the language. The common of languages investigated in this regard are languages of European family and Indo-Aryan languages liker Dari, Arabic and Pashto have not been adequately fortunate to be devoted thorough researches in this regard.
Highlights
A context-free grammar is a system to define languages
It is a formal grammar to produce all possible strings in a specified formal language; and in formal language theory, it is a specific form of formal grammar: a group of production instructions which describe all probable strings in a given formal language (Klabunde, R. 2002)
Context-free grammars have been widely used by computer scientists and linguist to describe the syntax of programming languages and natural languages
Summary
A context-free grammar is a system to define languages. It is a formal grammar to produce all possible strings in a specified formal language; and in formal language theory, it is a specific form of formal grammar: a group of production instructions which describe all probable strings in a given formal language (Klabunde, R. 2002).Context-free grammer is a potent formalism to define syntactic structure of formal language; it lets individuals to stipulate rules which state how a component can be segmented into smaller and smaller components, up to level of individual words. 2. Results and Discussion Context-free grammars have been widely used by computer scientists and linguist to describe the syntax of programming languages and natural languages. Defining the syntax of natural languages using Context-free grammars has been the object of interest of computer scientist and researchers for more than 6 decades.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
