A Further Note on Top-Down Deterministic Languages (Classic Reprint)

Derick Wood

ISBN 10: 1332130380 / ISBN 13: 9781332130382

Published by Forgotten Books, 2022

About this Item

Print on Demand. This book presents an in-depth analysis of top-down deterministic languages, a specific type of formal language used in computer science to describe the structure of programming languages. The author introduces two new families of languages, F(k) and U(k), which generalize top-down deterministic languages and provide new characterizations of s-grammars and LL(1) languages. The book also explores the closure properties of LL(k), F(k), and U(k) languages, providing a comprehensive understanding of their behavior under various operations. Additionally, the author establishes the existence of non-degenerate hierarchies for the F(k) and U(k) language families. By extending the notion of separability and introducing new families of languages, this book deepens our understanding of formal languages and their applications in computer science. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book.

Seller Inventory # 9781332130382_0

Bibliographic Details

• Title: A Further Note on Top-Down Deterministic Languages (Classic Reprint)
• Publisher: Forgotten Books
• Publication Date: 2022
• Language: English
• ISBN 10: 1332130380
• ISBN 13: 9781332130382
• Binding: Paperback
• Condition: New
• Book Type: print-on-demand item
• Seller catalogs:
  • Calculus

About this title

Synopsis

Unlock the rules of unambiguous language design with LL(k) grammars.

This nonfiction guide delves into how certain grammars determine when a language can be generated without ambiguity. It introduces key ideas like separability, L- and R-separability, and the role of s-separability in identifying deterministic behavior, along with practical implications for parsing theories.

• Learn foundational definitions for LL(k) grammars, e-free grammars, and s-grammars.
• See how separability and the prefix property influence unambiguity and parsing decisions.
• Discover how LL(k) languages relate to U(k) and F(k) languages, including important theorems and corollaries.
• Explore examples and transformations that illuminate when a grammar is unambiguous and how hierarchy results unfold.

Ideal for readers of theoretical computer science, formal languages, and parsing theory who want clear, structured insights into how grammar properties drive determinism and unambiguity.

About the Author

Eugene Fink received his B.S. degree from Mount Allison University (Canada) in 1991, M.S. from the University of Waterloo (Canada) in 1992, and Ph.D. from Carnegie Mellon University (USA) in 1999. He has been an assistant professor in the Computer Science and Engineering Department at the University of South Florida (USA) since 1999. His research interests include computational geometry, artificial intelligence, machine learning, and e-commerce.

Derick Wood received his B.Sc. (1963) and Ph.D. (1968) from the University of Leeds (UK). He was a Postdoctoral Fellow at the Courant Institute, New York University (USA), from 1968 to 1970, and then joined McMaster University (Canada) in 1970. He was a professor at the University of Waterloo (Canada) from 1982 to 1992, at the University of Western Ontario (Canada) from 1992 to 1995, and at the Hong Kong University of Science and Technology since 1995. He has published widely in a number of research areas and written two textbooks, "Theory of Computation" (John Wiley, 1987) and "Data Structures, Algorithms, and Performance" (Addison-Wesley, 1993).