{"id":"W1572415040","doi":"10.1007/978-3-540-77442-6_12","title":"Parser Combinators for Ambiguous Left-Recursive Grammars","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatory logic; Computer science; Programming language; Rule-based machine translation; Parsing; Haskell; Executable; Parsing expression grammar; L-attributed grammar; Context-free grammar; Natural language processing; Functional programming","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001721466,0.0007345522,0.0007925754,0.0009240352,0.0004193179,0.0007554501,0.004058846,0.0006009758,0.00001265985],"category_scores_gemma":[0.0001281109,0.0006513636,0.0003127542,0.0005311936,0.0008501142,0.0005085491,0.0009250417,0.0007724467,0.00007098367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004172704,"about_ca_system_score_gemma":0.0005541464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000118342,"about_ca_topic_score_gemma":0.000257992,"domain_scores_codex":[0.9948547,0.00003932005,0.0007323784,0.001945263,0.001141036,0.001287285],"domain_scores_gemma":[0.9966316,0.0004753796,0.0004845599,0.001561766,0.000520925,0.0003257952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008431834,0.00004322113,0.00006169551,0.00007685876,0.00002137527,0.00009893233,0.0007305956,0.0008843076,0.00001011643,0.4758323,0.00008504818,0.5221472],"study_design_scores_gemma":[0.0006195926,0.0005751768,0.00005298108,0.0001027773,0.00001753711,0.0001439922,7.074451e-7,0.03563168,0.0007232649,0.9312571,0.02977183,0.001103309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002836268,0.0007135561,0.9872454,0.0002749909,0.00614889,0.001172105,0.000003741505,0.0002779611,0.004134956],"genre_scores_gemma":[0.4667205,0.00009045471,0.5235164,0.003844928,0.001651613,0.0000701514,0.000036969,0.0001731415,0.003895863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5210438,"threshold_uncertainty_score":0.9995937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02770949785043535,"score_gpt":0.2629840501027917,"score_spread":0.2352745522523564,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}