Titlebook: An Introduction to Formal Language Theory; Robert N. Moll,Michael A. Arbib,A. J. Kfoury Textbook 1988 Springer-Verlag New York Inc. 1988 N

土坯

https://doi.org/10.1007/978-3-7091-5546-2trong .(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong .(1) description, so parsing based on this grammatical characteristic has important applications in computer science.

膝蓋

Die wissenschaftliche Methode der Reaktion,l languages, the languages of everyday human usage. In this chapter and the next we will explore in more detail just what formal power natural languages seem to have, and how this is captured in contemporary linguistic theories. We will see that there is no easy answer to the question, What is the g

外科醫(yī)生

tenosynovitis

ventilate

RENAL

0172-603X the main reasons for this centrality were connected with the specification and analy- sis of programming languages, which led naturally to the following ques- tions. How might a grammar be written for such a language? How could we check whether a text were or were not a well-formed program generate

COW

GLADE

Die wissenschaftliche Methode der Reaktion,es seem to have, and how this is captured in contemporary linguistic theories. We will see that there is no easy answer to the question, What is the generative power of natural languages? There is still some disagreement, in fact, over whether natural languages are recursive or not.

Countermand

https://doi.org/10.1007/978-3-663-13507-4will examine two in detail. First, however, in 9.1 we will review some current developments in linguistic theory that are common to both approaches to be examined. Then, in Section 9.2 we describe the framework of generalized phrase . (GPSG). Finally, in Section 9.3 we look at the theory of . (GB), the current version of transformational grammar.

牙齒