Tag #ll
24 papers:
- KDD-2018-YangSJ0 #clustering #mobile #predict #social
- I Know You'll Be Back: Interpretable New User Clustering and Churn Prediction on a Mobile Social Application (CY, XS, LJ, JH0), pp. 914–922.
- DocEng-2014-HailpernVD14a #named
- Truncation: all the news that fits we’ll print (JMH, NDV, MD), pp. 165–174.
- ECIR-2014-Koolen #exclamation #quote
- “User Reviews in the Search Index? That’ll Never Work!” (MK), pp. 323–334.
- OOPSLA-2014-ParrHF #adaptation #dynamic analysis #parsing #power of
- Adaptive LL(*) parsing: the power of dynamic analysis (TP, SH, KF), pp. 579–598.
- HCI-UC-2013-BeldadS #experience #online #trust
- It Was Nice with the Brick So Now I’ll Click: The Effects of Offline and Online Experience, Perceived Benefits, and Trust on Dutch Consumers’ Online Repeat Purchase Intention (AB, MS), pp. 371–380.
- CSCW-2011-SilfverbergLL #game studies #network #quote #social
- “I’ll press play, but I won’t listen”: profile work in a music-focused social network service (SS, LAL, AL), pp. 207–216.
- PLDI-2011-ParrF #generative #parsing
- LL(*): the foundation of the ANTLR parser generator (TP, KF), pp. 425–436.
- ITiCSE-2008-Garcia-OsorioGG #algorithm #education #lr #parsing
- A tool for teaching LL and LR parsing algorithms (CGO, CGP, NGP), p. 317.
- DAC-2007-SarnoWELGSLW
- IP Exchange: I’ll Show You Mine if You Show Me Yours (LS, RW, SKE, LL, JG, GS, SL, DW), pp. 990–991.
- DiGRA-2005-JornmarkAE #evolution #game studies #hardware #industrial
- Wherever Hardware, There'll be Games. The evolution of hardware and shifting industrial leadership in the gaming industry 1968-2004 (JJ, ASA, ME).
- CHI-1997-MoranPHCKMMZ #case study #multi #quote
- “I’ll Get That Off the Audio”: A Case Study of Salvaging Multimedia Meeting Records (TPM, LP, SRH, PC, DK, SLM, WvM, PZ), pp. 202–209.
- CC-1994-ParrQ #semantics
- Adding Semantic and Syntactic Predicates To LL(k): pred-LL(k) (TJP, RWQ), pp. 263–277.
- JICSLP-1992-Cerrito #calculus #unification
- Herbrand Methods in Sequent Calculi: Unification in LL (SC), pp. 607–621.
- OOPSLA-1987-Thorelli #type checking
- Modules and Type Checking in PL/LL (LET), pp. 268–276.
- SCC-1982-MauneyF #algorithm #lr #parsing
- A Forward Move Algorithm for LL and LR Parsers (JM, CNF), pp. 79–87.
- ICALP-1980-SippuS
- Characterizations of the LL(k) Property (SS, ESS), pp. 596–608.
- ICALP-1979-Friede
- Partitioned LL(k) Grammars (DF), pp. 245–255.
- ICALP-1979-MiltonF #attribute grammar #parsing
- LL(k) Parsing for Attributed Grammars (DRM, CNF), pp. 422–430.
- ICALP-1979-SippuS #on the #parsing
- On Constructing LL(k) Parsers (SS, ESS), pp. 585–595.
- ICALP-1977-Streinu #finite
- LL(k) Languages are Closed Under Union with Finite Languages (IS), pp. 504–508.
- POPL-1977-FischerMQ #parsing #performance
- An Efficient Insertion-Only Error-Corrector for LL(1) Parsers (CNF, DRM, SBQ), pp. 97–103.
- STOC-1977-Beatty #theorem
- Iteration Theorems for LL(k) Languages (JCB), pp. 122–131.
- ICALP-1976-Soisalon-SoininenU
- A Characterization of LL(k) Languages (ESS, EU), pp. 20–30.
- STOC-1974-Hammer
- A New Grammatical Transformation into LL(k) Form (MH), pp. 266–275.