scholarly journals Formalization of Context-Free Language Theory

2019 ◽  
Vol 25 (2) ◽  
pp. 214-214
Author(s):  
Marcus Vinícius Midena Ramos
Keyword(s):  
Language Theory ◽  
Context Free Language ◽  
Context Free ◽  
Free Language

scholarly journals A mechanisation of some context-free language theory in HOL4

2014 ◽  
Vol 80 (2) ◽  
pp. 346-362 ◽  
Author(s):  
Aditi Barthwal ◽  
Michael Norrish
Keyword(s):  
Language Theory ◽  
Context Free Language ◽  
Context Free ◽  
Free Language

scholarly journals On the Formalization of Some Results of Context-Free Language Theory

2016 ◽  
pp. 338-357 ◽  
Author(s):  
Marcus Vinícius Midena Ramos ◽  
Ruy J. G. B. de Queiroz ◽  
Nelma Moreira ◽  
José Carlos Bacelar Almeida
Keyword(s):  
Language Theory ◽  
Context Free Language ◽  
Context Free ◽  
Free Language

WHEN CHURCH-ROSSER BECOMES CONTEXT FREE

2007 ◽  
Vol 18 (06) ◽  
pp. 1293-1302 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER
Keyword(s):  
Linear Time ◽  
Membership Problem ◽  
Closure Properties ◽  
Context Free Language ◽  
Arithmetic Hierarchy ◽  
Context Free ◽  
Free Language

We investigate the intersection of Church-Rosser languages and (strongly) context-free languages. The intersection is still a proper superset of the deterministic context-free languages as well as of their reversals, while its membership problem is solvable in linear time. For the problem whether a given Church-Rosser or context-free language belongs to the intersection we show completeness for the second level of the arithmetic hierarchy. The equivalence of Church-Rosser and context-free languages is Π1-complete. It is proved that all considered intersections are pairwise incomparable. Finally, closure properties under several operations are investigated.

scholarly journals A note on the index of a context-free language

1970 ◽  
Vol 16 (2) ◽  
pp. 201-202 ◽  
Author(s):  
Neil D. Jones
Keyword(s):  
Context Free Language ◽  
Context Free ◽  
Free Language

Layered Region Based Flow-Sensitive Demand-Driven Alias Analysis

2014 ◽  
Vol 577 ◽  
pp. 917-920
Author(s):  
Long Pang ◽  
Xiao Hong Su ◽  
Pei Jun Ma ◽  
Ling Ling Zhao
Keyword(s):  
Program Analysis ◽  
Control Flow ◽  
Alias Analysis ◽  
Reachability Problem ◽  
Analysis Algorithm ◽  
Context Free Language ◽  
Context Free ◽  
Free Language ◽  
Demand Driven Analysis

The pointer alias is indispensable for program analysis. Comparing to point-to set, it’s more efficient to formulate the alias as the context free language (CFL) reachability problem. However, the precision is limited to flow-insensitivity. To solve this problem, we propose a flow sensitive, demand-driven analysis algorithm for answering may-alias queries. First the partial single static assignment is used to discriminate the address-taken pointers. Then the order of control flow is encoded in the level linearization code to ease comparison. Finally, the query of alias in demand driven is converted into the search of CFL reachability with feasible flows. The experiments demonstrate the effectiveness of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document