Links' Seminars and Public Events |
Fri, May 24, 2019 11:00 am 12:00 pm | Seminaire Sławek |
Fri, May 10, 2019 11:00 am 12:00 pm | Seminaire Iovka |
Fri, April 12, 2019 11:00 am 12:30 pm | Alexandre Vigny in Links Seminar |
Fri, April 5, 2019 11:00 am 12:00 pm | Semyon Grigorev in Links' seminar |
Fri, April 5, 2019 11:00 am 12:30 pm | Talk of Semyon Grigorev Title: Parsing techniques for context-free path querying Abstract: Context-free path querying (CFPQ) is a case of language constrained path querying: the way to specify constraints on paths in a graph in terms of formal languages. In CFPQ language is restricted to be a context-free. Classical parsing techniques and algorithms, such as generalized LR and LL parsing, or parser combinators, can be used for CFPQ. Results of adaptation of different parsing techniques for CFPQ will be presented. B31 |