2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1985 1984 1982 1980 1979 1978 1977 1976 1975
Reports
Weide, Th.P. van der, Ontleedmachines. 26 June, Technical University Eindhoven, 1975
In this masterthesis a formal system for parsing machines is introduced. Some properties of this class are introduced. Then a realization of parsing machines, using Dijkstras formalism (guarded commands), is presented, with a formal proof of correctness using both the weakest precondition calculus and Hoares calculus. A parsing condition on context free grammars is introduced, and it is proven that parsing machines can handle precisely those grammars.
In an appendix, a grammar transformation scheme is proposed that can transform the grammar of a parsable language into a parsable grammar.