Parsing Schemata

Parsing Schemata

by Klaas Sikkel

Part of Texts in Theoretical Computer Science An EATCS Series

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Parsing, the syntactic analysis of language, has been studied extensively in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introduction reviews the theory of parsing from a novel perspective. It provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text.

Discuss Parsing Schemata with other readers

Join or start a book club for Parsing Schemata on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Parsing Schemata?

Sign up free on Readfeed, then browse public clubs or start your own club with Parsing Schemata as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Parsing Schemata with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Parsing Schemata with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.