{"id":"https://openalex.org/W2012311890","doi":"https://doi.org/10.1109/ccece.2013.6567852","title":"The extension of deterministic cancellation parser to directly handle indirect and hidden left recursion","display_name":"The extension of deterministic cancellation parser to directly handle indirect and hidden left recursion","publication_year":2013,"publication_date":"2013-05-01","ids":{"openalex":"https://openalex.org/W2012311890","doi":"https://doi.org/10.1109/ccece.2013.6567852","mag":"2012311890"},"language":"en","primary_location":{"id":"doi:10.1109/ccece.2013.6567852","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccece.2013.6567852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019867915","display_name":"Omran Younessi","orcid":null},"institutions":[{"id":"https://openalex.org/I55547365","display_name":"Payame Noor University","ror":"https://ror.org/031699d98","country_code":"IR","type":"education","lineage":["https://openalex.org/I55547365"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Omran Younessi","raw_affiliation_strings":["University of Payame Noor, Sari, Iran","Univ. of Payame Noor, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]},{"raw_affiliation_string":"Univ. of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087045183","display_name":"Mohamad H. Bahrololoomi","orcid":null},"institutions":[{"id":"https://openalex.org/I55547365","display_name":"Payame Noor University","ror":"https://ror.org/031699d98","country_code":"IR","type":"education","lineage":["https://openalex.org/I55547365"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohamad H. Bahrololoomi","raw_affiliation_strings":["University of Payame Noor, Sari, Iran","Univ. of Payame Noor, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]},{"raw_affiliation_string":"Univ. of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015225134","display_name":"Abedin Yazdani","orcid":null},"institutions":[{"id":"https://openalex.org/I55547365","display_name":"Payame Noor University","ror":"https://ror.org/031699d98","country_code":"IR","type":"education","lineage":["https://openalex.org/I55547365"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Abedin Yazdani","raw_affiliation_strings":["University of Payame Noor, Sari, Iran","Univ. of Payame Noor, Sari, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]},{"raw_affiliation_string":"Univ. of Payame Noor, Sari, Iran","institution_ids":["https://openalex.org/I55547365"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4941,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75846491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7692887783050537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.762779712677002},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7079229950904846},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.5785263180732727},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.48284751176834106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4319957494735718},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.4165101647377014},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3910382390022278},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38922908902168274},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3100157082080841},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.1816616654396057},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.0807526707649231}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7692887783050537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.762779712677002},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7079229950904846},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.5785263180732727},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.48284751176834106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4319957494735718},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.4165101647377014},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3910382390022278},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38922908902168274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3100157082080841},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.1816616654396057},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0807526707649231}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccece.2013.6567852","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccece.2013.6567852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W25995434","https://openalex.org/W158755604","https://openalex.org/W1542833864","https://openalex.org/W1550975773","https://openalex.org/W1571697030","https://openalex.org/W1859633635","https://openalex.org/W1902163250","https://openalex.org/W2031830821","https://openalex.org/W2049814260","https://openalex.org/W2101092231","https://openalex.org/W2105847779","https://openalex.org/W2148708444","https://openalex.org/W2149205735","https://openalex.org/W3141063257","https://openalex.org/W4206078070","https://openalex.org/W6632751421","https://openalex.org/W6639172804","https://openalex.org/W6681950690"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W2155605358","https://openalex.org/W2044963554","https://openalex.org/W2374742784","https://openalex.org/W1563586960","https://openalex.org/W3161063338","https://openalex.org/W2073366168","https://openalex.org/W2075052434","https://openalex.org/W560887346","https://openalex.org/W2896379815"],"abstract_inverted_index":{"Traditional":[0],"top-down":[1,106],"parsers":[2],"have":[3],"both":[4,97],"merits":[5],"and":[6,13,100,107,151],"constraints.":[7],"Their":[8],"structure":[9,17,51],"is":[10,56,135,165],"often":[11],"simple":[12],"similar":[14],"to":[15,136,142,159],"the":[16,19,44,49,53,64,88,111,114,125,138],"of":[18,34,40,52,77,113,146,181,184,189],"original":[20,139],"grammar.":[21],"Furthermore,":[22],"they":[23,29,73],"can":[24,67,95],"handle":[25,31,69,96,143],"empty":[26,80,98],"rules":[27,54,99],"but":[28],"cannot":[30],"various":[32],"types":[33],"left":[35,70,102,147,153,190],"recursion":[36,71,103,191],"in":[37,124,132],"grammars.":[38],"Transformation":[39],"left-recursive":[41,200],"grammars":[42],"during":[43,110],"normalization":[45],"process":[46],"will":[47],"affect":[48],"semantic":[50],"which":[55,90,155,175],"not":[57,75],"appropriate.":[58],"The":[59,82,128,162],"bottom-up":[60,108],"parsing":[61,126],"methods,":[62],"on":[63],"other":[65],"hand,":[66],"easily":[68],"while":[72],"are":[74,156],"capable":[76],"working":[78,185],"with":[79,170,186],"rules.":[81],"deterministic":[83,167],"cancellation":[84,168],"parser":[85,164,169],"represented":[86],"by":[87,104],"authors,":[89],"has":[91,176],"a":[92,121,166,171],"recursive-descent":[93],"structure,":[94,174],"direct":[101],"combining":[105],"cycles":[109],"construction":[112],"parse":[115],"tree.":[116],"In":[117],"fact,":[118],"it":[119],"employs":[120],"non-canonical":[122],"approach":[123],"process.":[127],"most":[129],"important":[130],"struggle":[131],"this":[133],"paper":[134],"extend":[137],"parser's":[140],"ability":[141],"all":[144,187],"kinds":[145,188],"recursion,":[148,154],"including":[149],"indirect":[150],"hidden":[152],"more":[157,177],"complicated":[158],"be":[160],"handled.":[161],"resulting":[163],"recursive":[172],"decent":[173],"acceptance":[178],"power,":[179],"because":[180],"its":[182],"capability":[183],"without":[192],"any":[193],"need":[194],"for":[195],"transforming":[196],"them":[197],"into":[198],"non":[199],"equivalents.":[201]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}