Defining fitness function for search based assessment of grammar reachability
Certain generalized graph nodes reachability problems, such as data dependency flow, have been reformulated as Context Free Grammar (CFG) nonterminals reachability problems, and addressed using grammar reachability analysis. The reformulation efforts could be extended by reformulating such problems...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
American Scientific Publishers
2018
|
Online Access: | http://psasir.upm.edu.my/id/eprint/64716/1/Defining%20fitness%20function%20for%20search%20based%20assessment%20of%20grammar%20reachability.pdf http://psasir.upm.edu.my/id/eprint/64716/ https://www.ingentaconnect.com/contentone/asp/asl/2018/00000024/00000003/art00047;jsessionid=2agrjpvks6cdi.x-ic-live-03 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://psasir.upm.edu.my/id/eprint/64716/1/Defining%20fitness%20function%20for%20search%20based%20assessment%20of%20grammar%20reachability.pdfhttp://psasir.upm.edu.my/id/eprint/64716/
https://www.ingentaconnect.com/contentone/asp/asl/2018/00000024/00000003/art00047;jsessionid=2agrjpvks6cdi.x-ic-live-03