Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with Incomplete Code Fragments
ACM SIGPLAN via YouTube
Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
Launch a New Career with Certificates from Google, IBM & Microsoft
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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