Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with Incomplete Code Fragments
ACM SIGPLAN via YouTube
Build AI Apps with Azure, Copilot, and Generative AI — Microsoft Certified
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a groundbreaking 17-minute conference talk from PLDI 2024 that introduces a novel approach to syntactic code search. Delve into the innovative search architecture developed by researchers from UC Berkeley, Carnegie Mellon University, and Apple, which enables tree-aware wildcards and supports in-progress query specifications. Learn about the stsearch tool, which leverages this new approach to provide more flexible and interactive code search capabilities. Discover how this method compares to existing tools like Semgrep and Comby, and understand its potential impact on improving support for interactive coding environments. Gain insights into the underlying concepts of tree automata and tokenization that power this advancement in lightweight syntactic analysis.
Syllabus
[PLDI24] Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with(…)
Taught by
ACM SIGPLAN