2026-07-23T19:43:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2599 2024-03-06T10:33:34Z ddc:004 open_access

Timed Definite Clause Omega-Grammars Saeedloei, Neda Gupta, Gopal Constraint Logic Programming over reals Co-induction Context-Free Grammars Omega-Grammars We propose timed context-free grammars (TCFGs) and show how parsers for such grammars can be developed using definite clause grammars (DCGs) coupled with constraints over reals (CLP(R)). Timed context-free grammars describe timed context-free languages (TCFLs). We next extend timed context-free grammars to timed context-free omega-grammars (omega-TCFGs for brevity) and incorporate co-inductive logic programming in DCGs to obtain parsers for them. Timed context-free omega-grammars describe timed context-free languages containing infinite-sized words, and are a generalization of timed omega-regular languages recognized by timed automata. We show a practical application of omega-TCFGs to the well-known generalized railroad crossing problem. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Neda Saeedloei and Gopal Gupta 2010 Is Part Of LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2010.212 urn:nbn:de:0030-drops-25994 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.212 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode