{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002644233,0.001181728,0.002210766,0.001990758,0.001995916,0.00655694,0.002784405,0.002194198,0.01916919],"category_scores_gemma":[0.008215745,0.00213827,0.002446179,0.00290997,0.003524115,0.009621294,0.004546966,0.00462357,0.007156552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001874574,"about_ca_system_score_gemma":0.001804167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142722,"about_ca_topic_score_gemma":0.002214123,"domain_scores_codex":[0.9980224,0.0003885991,0.0002731405,0.0003840367,0.0006741448,0.0002577238],"domain_scores_gemma":[0.9953543,0.002739295,0.000216469,0.001100167,0.0004388472,0.0001510687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007997225,0.00003806862,0.0003563811,0.000222271,0.00002342224,0.0005106248,0.0007652196,0.002706432,0.002758575,0.9035234,0.01135943,0.07765619],"study_design_scores_gemma":[0.00003244754,0.00001108117,0.0001228958,0.0000967174,0.0000374002,0.0004172794,0.00009955428,0.01723717,0.005258958,0.9407525,0.03587038,0.00006361613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01125472,0.00094676,0.9491447,0.0006708095,0.0003673894,0.00008873446,0.0006266792,0.01028725,0.02661291],"genre_scores_gemma":[0.3219194,0.002431341,0.6057033,0.0008737441,0.0004830499,0.0003623515,0.002482675,0.01310287,0.05264134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01916919,"threshold_uncertainty_score":0.06412733,"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."}}