基于CYK算法的上下文无关语法歧义分析

2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave) Pub Date : 2016-02-01 DOI:10.1109/STARTUP.2016.7583989

R. Dharmik, R. Bhanuse, A. D. Gaikwad

{"title":"基于CYK算法的上下文无关语法歧义分析","authors":"R. Dharmik, R. Bhanuse, A. D. Gaikwad","doi":"10.1109/STARTUP.2016.7583989","DOIUrl":null,"url":null,"abstract":"The syntax analysis phase of a Compiler is to check syntactic structure of Programming Language construct using Context Free Grammar. Either by using Top-Down or Bottom-Up parsing technique to parse string of a given language. The string of a Language is successfully parsed by parser of Context Free Grammar then that string is syntactically correct. In this paper CYK algorithm is membership algorithm which gives string is member of language generated by Context Free Grammar or not. We have found out the Context Free Grammar is ambiguous or not using CYK algorithm.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Ambiguity of Context Free Grammar using the CYK algorithm\",\"authors\":\"R. Dharmik, R. Bhanuse, A. D. Gaikwad\",\"doi\":\"10.1109/STARTUP.2016.7583989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The syntax analysis phase of a Compiler is to check syntactic structure of Programming Language construct using Context Free Grammar. Either by using Top-Down or Bottom-Up parsing technique to parse string of a given language. The string of a Language is successfully parsed by parser of Context Free Grammar then that string is syntactically correct. In this paper CYK algorithm is membership algorithm which gives string is member of language generated by Context Free Grammar or not. We have found out the Context Free Grammar is ambiguous or not using CYK algorithm.\",\"PeriodicalId\":355852,\"journal\":{\"name\":\"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/STARTUP.2016.7583989\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STARTUP.2016.7583989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

编译器的语法分析阶段是使用上下文无关语法检查程序设计语言结构的语法结构。使用自顶向下或自底向上的解析技术来解析给定语言的字符串。如果语言的字符串被上下文无关语法的解析器成功解析，那么该字符串在语法上是正确的。本文中的CYK算法是一种隶属度算法，它决定字符串是否是由上下文无关语法生成的语言的成员。我们发现上下文无关语法不明确或没有使用CYK算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Ambiguity of Context Free Grammar using the CYK algorithm

The syntax analysis phase of a Compiler is to check syntactic structure of Programming Language construct using Context Free Grammar. Either by using Top-Down or Bottom-Up parsing technique to parse string of a given language. The string of a Language is successfully parsed by parser of Context Free Grammar then that string is syntactically correct. In this paper CYK algorithm is membership algorithm which gives string is member of language generated by Context Free Grammar or not. We have found out the Context Free Grammar is ambiguous or not using CYK algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)

自引率

0.00%

发文量