[Updated on Apr. 18] Integration of CiNii Articles into CiNii Research

On Extending Matching Operation in Grammar Programs for Program Inversion

Search this article

Abstract

The inversion method proposed by Gliick and Kawabe uses grammar programs as intermediate results, that comprise sequences of operations (data generation, matching, etc.). The semantics of the grammar programs is denned as a stack machine where data terms are stored in the stack. The matching operation for a constructor symbol pops up the topmost term of the stack and pushes its direct subterms to the stack if the topmost term is rooted by the constructor. This paper strengthens the matching operation by augmenting a parameter that specifies what position the matching operation can look into from the top of the stack. This extension is sometimes effective to avoid the failure execution of the determinization method based on LR parsing described in the latter half of the inversion method.

identifier:http://ci.nii.ac.jp/naid/110009626477/

identifier:http://hdl.handle.net/2237/23557

Journal

Citations (0)*help

See more

References(23)*help

See more

Related Articles

See more

Related Data

See more

Related Books

See more

Related Dissertations

See more

Related Projects

See more

Related Products

See more

Details

Report a problem

Back to top